• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.298-305
• /
• 2003

In this paper, we proposed a high performance lookup controller for IP packet forwarding engine of ATM based label edge routers. The lookup controller is designed to provide services such as MPLS, VPN, ELL, and RT services as well as the best effort. For high speed searching for IP addresses, we employed a TCAM based hardware search device not using traditional algorithmic approaches. We also implement lookup control functions into FPGA for fast processing of packet header and lookup control. The proposed lookup controller is designed to support differenciated services for users and to process in pipelined mechanism for performance improvement. A two-step search scheme is also applied to perform lookup for the key combined with multi-field of packet header. We found that the proposed lookup controller provides the performance of about 16M packets per second through simulations.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.417-424
• /
• 2001

Internet networks consisting of existing routers show the limits in efficiency of traffic managements. In order to overcome the limits, MPLS System is high speed switching technology and is not based on IP address but based on label was designed. However MPLS system being based on ATM has the difficulties of supporting Qos(Quality of Service). This paper suggested the way to consist a service-assured-network using CR-LDP protocol which was designed for guaranteeing QoS in MPLS system being based on ATM switch and using qGSMP protocol, and the way to implicitly establish LSP by implementing QoS Translation and QoS Mapping in LER System.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.575-580
• /
• 2006

인터넷 네트워크에 존재하는 방화벽(Firewall) 또는 라우터(Router) 장비에서의 패킷 필터 기능은 모든 방화벽 장비의 기본적인 기능이 될 수 있다. 하지만 최근에 등장한 세션기반의 악의적 침입과 바이러스의 출현으로 패킷 필터기는 단순한 정적 패킷 필터 기능이 아닌 상태기반 패킷 필터의 동적 패킷 필터 기능을 요구하게 되었다. 또한 최근에 인터넷 속도가 급증하는 환경변화에 맞추어 방화벽 장비의 TCP 패킷 처리기능은 매우 빠른 처리속도를 요구하고 있다. 이에 우리는 매우 빠른 고속의 TCP 상태기반 패킷 필터 처리를 요구하는 에지(Edge)급 라우터의 방화벽 옵션카드를 만들기 위해 하드웨어 기반의 TCAM(Ternary CAM) 관리를 이용한 TCP 세션 상태기반 (Stateful) 패킷 필터기를 구현하였으며, TCAM 제어와 패킷의 상태기반 검사 등 모든 기능처리는 FPGA(Field Programmable Gate Array)를 이용한 하드웨어 로직(Logic) 및 상태기(State Machine)로 구현하였다. 그리고 본 논문의 구현방식을 적용한 방화벽 옵션카드는 인-라인(In-line) 모드로 구성될 경우 1GHz 이상의 Wire Speed를 만족하는 처리성능을 보여주었다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.10
• /
• pp.10-17
• /
• 2001

For high-speed Internet services, considerations on interworking methods are required for interworking between networks with different technologies. lnterworking and structures in interworking point nodes can affect on transfer efficiency. This paper proposes interworking procedures and functions of the edge routers for overhead reduction in MPOA-MPLS networks. The MPLS networks can be based on ATM technology. Therefore, we consider ATM seamless connections for the interworking and compare the proposed method with that without seamless connection. We perform computer simulations to get both of the transfer delays and throughputs for the comparison., we describe required interworking functions and operations in the edge routers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2871-2877
• /
• 2014

Real-time communication and diversification of multimedia application services using high-capacity data over the Internet demand high speed connection, and real-time and high-speed access internet service such as multimedia make Internet traffic increase rapidly. Meanwhile, QoS (Quality of Service) of internet service is not satisfied. In this situation, ISP (Internet Service Provider) has been required to improve service quality and extend network according to the user's needs. This request includes issue of extending network focused on increasing router and the number of routing table as well as simply extending bandwidth.

• Convergence Security Journal
• /
• v.17 no.2
• /
• pp.41-51
• /
• 2017

The explosive increase in the range of Internet usage gradually makes the speed and capacity of network high-speed, rapidly evolving it into mass storage. Accordingly, network equipment such as switch and router are coping with it through hardware-based rapid technological evolution, but as the technological development of the most basic and essential network security system in the hyper-connected society requires frequent alterations and updates about the security issues and signatures of tens of thousands, so it is not easy to overcome the technical limitations based on the software. In this paper, to improve problems in installing and operating such anti-DDoS devices, we propose a Hi-DPI algorithm best reflecting the hardware characteristics and parallel processing characteristics of FPGA (Field Programmable Gate Array), and would verify the practicality.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.833-839
• /
• 2007

In case of wireless sensor networks being applied to a target environment having continuous data transfer, high-speed data transmission and processing is necessary to meet increased bandwidth needs. This paper proposes a novel multipath routing algorithm to increase the bandwidth of continuous data stream for the wireless sensor network using dual channel routers. We evaluate performance of the proposed algorithm in the wireless sensor network using the dual channel touter based on ZigBee protocol. According to the experimental evaluation, the proposed algorithm showed outstanding performance enhancement with the bandwidth of 150kbps, which is about twice of existing single channel router.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.154-162
• /
• 2001

In this paper, we investigate the scheduling algorithm of router system for Internet service based on the qualify-of-service (QoS) level of the input source traffics. We suggest an approprite scheduling algorithm in order to satisfy their QoS requirements for the loss-sensitive traffic and delay-sensitive traffic. For this purpose, we first study the service requirements of the multiplexer in Internet and the definition of QoS based on the ITU-T white recommendations. Second. we suggest a functional architecture of the multiplexer and the scheduling algorithm to satisfy various QoS requirements for Internet service. Finally. the performance measures of interest, namely steady-state packet loss probability and average delay, are discussed by simulation results.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.262-276
• /
• 2001

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.138-143
• /
• 2003

One of the important design issues for IP routers responsible for packet forwarding in computer networks is the route-lookup mechanism. For each incoming packet, IP routing requires that a router performs a longest-prefix-match address lookup in order to determine the next hop that the incoming packet should be forwarded to. In this paper, we present a new scheme which applies the hashing function for IP address lookup. In the proposed scheme, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in each prefix. Hashing function is applied in order to find out the matching entries from the address lookup tables in parallel, and the entry with the longest prefix match among them is selected. Simulation using the MAE-WEST router example shows that a large routing table with 37000 entries can be compacted to a forwarding table of 300 Kbytes in the proposed scheme. It is also shown that the proposed scheme achieves one route lookup every 1.93 memory accesses in average.