• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.637-658
• /
• 2015

The development of multimedia applications has followed the development of high-speed networks. By improving the performance of mobile devices, it is possible to provide high-transfer-speed broadband and seamless mobile multicasting services between indoor and outdoor environments. Multicasting services support efficient group communications. However, mobile multicasting services have two constraints: tunnel convergence and handoff latency. In order to solve these problems, many protocols and handoff methods have been studied. In this paper, we propose inter local mobility anchor (inter-LMA) optimized handoff model for mobile multicasting services in proxy mobility IPv6 based (PMIPv6-based) networks. The proposed model removes the tunnel convergence issue and reduces the router processing costs. Further, it the proposed model allows for the execution of fast handoff operations with adaptive transmission mechanisms. In addition, the proposed scheme exhibits low packet delivery costs and handoff latency in comparison with existing schemes and ensures fast handoff when moving the inter-LMA domain.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.129-142
• /
• 2004

As the Internet gets faster, the demand for high-speed routers that are capable of forwarding more than giga bits of data per second keeps increasing. In the previous research, Bitmap Trie algorithm was developed to rapidly execute LPM(longest prefix matching) process which is Well known as the Severe performance bottleneck. In this paper, we introduce a novel algorithm that drastically enhanced the performance of Bitmap. Trie algorithm by applying three techniques. First, a new table called the Count Table was devised. Owing to this table, we successfully eliminated shift operations that was the main cause of performance degradation in Bitmap Trie algorithm. Second, memory utilization was improved by removing redundant forwarding information from the Transfer Table. Lastly. the range of prefix lookup was diversified to optimize data accesses. On the other hand, the processing delays were classified into three categories according to their causes. They were, then, measured through the execution-driven simulation that provides the higher quality of the results than any other simulation techniques. We tried to assure the reliability of the experimental results by comparing with those that collected from the real system. Finally the Enhanced Bitmap Trie algorithm reduced 82% of time spent in previous algorithm.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.333-340
• /
• 2004

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.

• 한국정보통신설비학회:학술대회논문집
• /
• 2004.08a
• /
• pp.239-243
• /
• 2004

네트워크 프로세서는 주로 라우터에 위치하여 데이터의 트래픽을 관리를 하였다. 네트워크 프로세서는 데이터의 빠른 전송을 위해 점차 발달하였으며, 종류 또한 다양해졌다. 본 논문에서는 네트워크 프로세서의 아키텍처가 빠른 패킷 처리를 위해 어떻게 발전하였는지 알아본다. 또한 기존의 네트워크 프로세서들이 어디서 동작하고, 어떤 아키텍처를 썼는지를 기준으로 분석하고, 분석 결과를 분류하였다. 네트워크 프로세서는 router나 line card 등의 다양한 위치에 위치하며, OSI 계층의 사용범위가 다양함을 보여 주었다.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.375-378
• /
• 2001

A 640Gb/s very advanced ATM switching system using 0.25um CMOS VLSI, 40 layer ceramic MCM and 10Gb/s, 8 wavelength 8$\times$8 optical WDM interconnection has been fabricated. To break though the interconnection bottleneck, optical WDM interconnection is used. It has 20Gb/s 8 wavelength 8$\times$8 interconnection capability. It realizes 640Gb/s interconnections within a very small size. Preliminary tests show that 800b1s ATM switch MCM and optical WDM interconnection technologies can be applied to future high speed broadband networks

• Annual Conference of KIPS
• /
• 2005.05a
• /
• pp.1397-1400
• /
• 2005

Multiprotocol Label Switching is an initiating IETF that integrated Layer2 information network links(bandwidth, latency, utilization) to Layer 3(IP) with a particular autonomous system(or ISP) in order to simplify and improve IP-packet exchange. MPLS gives network operators a grate deal of flexibility to divert and route traffic around link failures, congestion, and bottlenecks. The MPLS has advantages that will be able to solve existing problem of Network that ISP have had IP, QoS, Gigabit forwarding and traffic engineering. The purpose of this study is to measure Access-list and the capacities of PE Router that would operate as MPLS. Many ISP using MPLS service to handle high-speed internet traffic with apply to firewall in future.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.472-474
• /
• 2001

인터넷 사용자들의 요구에 부응하기 위해 인터넷 트래픽은 점차 멀티미디어화, 고대역화로 나아가고 있다. 이에 따라 초고속 통신망의 구축이 전 세계적으로 활발히 이루어지고 있으며 고속의 백본망에서 고속 라우터의 중요성이 대두되었다. 고속 라우터는 차세대 인터넷 환경의 핵심장비이며, 고속 라우터를 안정적이며 효율적으로 관리하는 것이 중요한 문제로 대두되고 있다. 아울러 현재 고속 라우터에서 제공하는 다양한 응용 서비스를 효율적이고, 편리한 방법으로 제공할 수 있도록 해주는 망관리 매니저의 역할이 중요하다. 본 논문에서는 고속 라우터 시스템의 Web 기반 SNMP(Simple Network Management Protocol) 망관리 메니저 기능과 EWS(Embedded Web Server)을 이용한 운용자 정합기능을 설계하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5A
• /
• pp.509-516
• /
• 2008

The Fast Handover in Hierarchical Mobile IPv6(F-HMIPv6) scheme provides a seamless handover in mobile IP networks effectively. However, there is a problem that the mobile node can lose its connectivity to the previous access router because of a sudden degradation of the link quality during fast handover procedure. Additionally, in many cases, the mobile node does not have enough time to exchange messages during the fast handover procedure, especially in case of movement with high speed during handover. In this paper, we propose a modification to F-HMIPv6 that significantly reduces the time to exchange messages during fast handover procedure and thereby increases the probability which the F-HMIPv6 can perform the fast handover in predictive mode.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.889-890
• /
• 2016

Existing machine-to-machine collaboration system is a centralized structure system fo built OpenWrt and a Web server on the router. But scarce resources of the router are getting more requests from the collaboration client when a problem has occurred with increasing probability of a client object, the higher the traffic. In this paper, in order to solve the problem, we propose a distributed system utilizing Machine Socialization cooperation algorithm. The MCU attached to the machine to minimize the traffic occurrence probability and loss of the data by processing to distribute the data between the server and the client. Also improve the response speed between the server and the client and the operation stop caused by the loss of data. The proposed system will be utilized if the IoT field will be high efficiency compared to existing systems.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.