• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.57-67
• /
• 2009

Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.261-264
• /
• 2001

This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.

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

최근 이동 단말 사용자의 수가 급증함에 따라 네트워크 트래픽을 줄여 신속한 호 설정을 가능하게 하는 것이 중요하게 되었다. 이러한 목적을 달성하기 위하여, 빈번하게 호 요청을 하는 이동 단말들에 대해서는 캐쉬를 사용하는 기법이 제안되었다. 그러나, 기존의 캐쉬 기법은 낮은 캐쉬 실패와, 캐쉬 실패 발생시 불필요한 네트워크 지연을 초래하는 문제점이 있다. 본 논문에서는 이동 단말 사용자들이 이동 지역성을 가진다는 점을 이용하여 캐쉬 실패가 발생하더라도 HLR까지 질의하지 않고 포워딩 포인터를 따라 인접 VLR들을 질의하게 함으로써 시스템 전반적으로 위치 질의 비용을 줄여 신속한 호 설정을 가능하게 한다. 이는 HLR로 집중되는 네트워크 트래픽을 감소시켜 PCS 네트워크 사용자들에게 보다 나은 QoS를 제공하는데 이용될 수 있다. 아울러 제안하는 기법이 기존의 위치 관리 기법들보다 위치 관리비용 측면에서 보다 효율적임을 수학적 성능 분석 모델을 통하여 보인다.

• Annual Conference of KIPS
• /
• 2002.04b
• /
• pp.1261-1264
• /
• 2002

개인 통신 서비스에서 주된 당면 문제중의 하나는 위치를 자주 이동하는 많은 이동 단말기들의 위치를 찾는 것이다. 위치 관리를 성취하기 위하여 많은 네트워크 신호처리 트래픽과 데이터베이스 질의가 요구된다. 다수의 정책들은 이동 단말기의 현재 위치를 저장하기 위하여 위치 레지스터 데이터베이스를 사용하고, 그 위치 레지스터의 고장에 대해 약점을 가지고 있다. 이 논문에서, 우리는 위치 레지스터들의 고장을 포용하는 분산 홈 위치 레지스터를 갖는 결함 포용 전방 포인터 방법을 제안한다. 제안하는 방법의 성공을 분석적 모델로 평가하고, Biaz의 우회 전방 정책, 두개 경로 전방 정책과 성능을 비교한다.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.167-172
• /
• 2004

Although Mobile IP proposed in IETF is effective. it has inefficiency in case mobile hosts communicate with each others while they are roaming frequently in a specific area. It occurs lots of latency because mobile hosts must be registered and establish an secure path under the internet emvironments and transmitting data on the path. Additionally this inefficiency is more aggravated in case mobile hosts has high mobility. Thus this paper propose a method using Anchor foreign agent by Anchor chain method which combine an pointer forwarding and a cache method plus a border router as a way to complement the above problem which exists in an mobility management in a specific area.

• Journal of Digital Contents Society
• /
• v.14 no.3
• /
• pp.283-290
• /
• 2013

The current centralized mobility control protocols such as proxy mobile IPv6 (PMIPv6) are dependent on a central mobility anchor to process all control/data traffic. However, such centralized mobility control protocols have some drawbacks such as traffic concentration into the core network and serious service degradation in case of the failure of such a centralized mobility anchor, etc. In this paper, therefore, in order to alleviate these drawbacks, we propose a PMIPv6-based distributed mobility control scheme considering a user's movement locality. Performance evaluation results demonstrate that the proposed scheme has apparent potentials to alleviate serious drawbacks of S-PMIP, which is a closely-related distributed mobility control scheme, as well as PMIPv6, while reducing the total mobility control cost.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.