Browse > Article
http://dx.doi.org/10.3745/KIPSTC.2003.10C.5.641

A Partitioned Compressed-Trie for Speeding up IP Address Lookups  

Park, Jae-Hyung (전남대학교 전자컴퓨터정보통신공학부)
Jang, Ik-Hyeon (동국대학교 정보통신공학과)
Chung, Min-Young (성균관대학교 정보통신공학부)
Won, Yong-Gwan (전남대학교 정보통신공학부ㆍ의학부)
Publication Information
The KIPS Transactions:PartC / v.10C, no.5, 2003 , pp. 641-646 More about this Journal
Abstract
Packet processing speed of routers as well as transmission speed of physical links gives a great effect on IP packet transfer rate in Internet. The router forwards a packet after determining the next hop to the packet's destination. IP address lookup is a main design issue for high performance routers. In this paper, we propose a partitioned compressed-trie for speeding-up IP address lookup algorithms based on tie data structure by exploiting path compression. In the ,proposed scheme, IP prefixes are divided into several compressed-tries and lookup is performed on only one partitioned compressed-trie. Memory access time for IP address lookup is lessen due to compression technique and memory required for maintaining partition does not increased.
Keywords
Internet Router; IP Lookup; Prefix Trie; IP Addressing System; Compressed Trie;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Aweya, 'On the Design of IP Routers Part 1 : Router Architectures,' Journal of Systems Architecture, Vol.46, No.6, pp.483-511, Apr., 2000   DOI   ScienceOn
2 S. Keshav and R. Rharma, 'Issues and Trends in Router Design,' IEEE Communications Magazine, Vol.36, No.5, pp.144-151, May, 1998   DOI   ScienceOn
3 V. Srinivasan and G. Varghese, 'Fast Address Lookups using Controlled Prefix Expansion,' ACM Trans. on Computer Systems, Vol.17, No.1, pp.1-40, Feb., 1999   DOI   ScienceOn
4 W. Doeringer, G. Karjoth and M. Nassehi, 'Routing on Longest Matching Prefixes,' IEEE/ACM Transaction on Networking, Vol.4, pp.86-97, Feb., 1996   DOI   ScienceOn
5 V. Fuller, T. Li, J. Yu and K.Varadhan, 'Classless Inter-Domain Routing (CIDR) and Address Assignment and Aggregation Strategy,' RFC1519, Sep., 1993
6 P. Gupta, S. Lin and N. Mckweon, 'Routing Lookups in Hardware at Memory Access Speeds,' Proc. of INFOCOM, pp.1240-1247, 1998   DOI
7 E. Horowitz and S. Sahni, 'Fundamentals of Data Structures in C,' Computer Science Press, 1993
8 이인복, 박근수, 최양희, 정성권, '세그먼트 트리를 이용한 IP주소 검색', 정보과학회지 : 시스템 및 이론
9 A. J. McAuley and P. Francis, 'Fast Routing Table Lookup using CAMs,' Proc. of IEEE Infocom, pp.1382-1391, 1993
10 'BGP Table Statistics,' http://bgp.potaroo.net
11 MMC Networks Co., 'EPIF4-L3 Reference Manual,' Oct., 1998
12 D. Morrison, 'PATRICIA-Practical Algorithm To Retrieve Information Coded In Alphanumeric,' Journal of ACM, Vol.5, No.4, pp.514-534, Oct., 1968   DOI
13 S. Nilsson and G. Karlsson, 'IP-Address Lookup using LC-Tries,' Journal of Selected Areas in Communications, Vol. 17, No.6, pp.1083-1092, Jun., 1999   DOI   ScienceOn
14 K. Sklower, 'A Tree-based Routing Table for Berkeley Unix,' Technical Report, Univ. of California, Berkeley, 1993
15 H. Tzeng and T. Przygienda, 'On Fast Address-Lookup Algorithms,' IEEE Journal of Selected Areas in Communications, Vol.17, No.6, pp.1067-1082, Jun., 1999   DOI   ScienceOn
16 P. -C. Wang, C.-T. Chan and Y.-C. Cheng, 'A Fast IP Routing Lookup Scheme,' Proc. of ICC, pp.1140-1144, 2000