The KIPS Transactions:PartA (정보처리학회논문지A)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A Fast IP Lookups using Dynamic Trie Compression

능동적 트라이 압축을 이용한 고속 IP 검색

  • 오승현 (동국대학교 컴퓨터학과)
  • Published : 2003.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

IP address lookup of router searches and decide proper output link using destination address of IP packet that arrie into router. The IP address lookup is essential part in te development of high-speed router needed to high-speed backbone network as one of bottleneck of router performance. This paper introduces DTC data structure that can support gigabit IP address lookup by dynamic trie compression technique that just uses small memory in conventional Pentium CPU. When make a forwarding table by trie compression, the DTC can dynamically select a size of data structure with considering correlation between table's size and searching speed. Also, when compress the prefix trie, DTC makes IP address lookup on the forwarding table of a search on the high speed SRAM cache by minimizing the size of data structure reflecting the structure of the trie. In the experiment result, the DTC data structure recorded performance of maximum $12.5{\times}10^5$ LPS (lookup per second) in conventional Pentium CPU through a dynamic building of most suitable compression over variety of routing tables.

리우터의 IP 주소검색은 라우터에 도착한 IP 패킷의 목적지 주소를 이용하여 적절한 출력링크를 검색하고 결정하는 것이다. IP 주소검색은 라우터 성능의 병목지점 중의 하나로써 고속 백본망에 필요한 초고속 라우터 개발에 필수적인 부분이다. 본 논문은 보통의 펜티엄 CPU에서 능동적인 트라이(Trie) 압축기법을 이용하여 작은 메모리만으로 기가비트급 IP 주소검색을 실시할 수 있는 동적 트라이 압축(Dynamic Trie Compression) 자료구조를 소개한다. DTC 자료구조는 트라이를 압축하여 포워딩 테이블을 만들 때 테이블의 크기와 검색속도의 상관관계를 고려하여 능동적으로 테이블의 크기를 선태할 수 있다. 또한 트라이를 압축할 때 트라이의 구조를 반영하여 자료구조의 크기를 최소화함으로써 포워딩 테이블에 대한 IP 주소검색이 고속의 SRAM 캐시 검색이 되도록 한다. 실험결과에서 DTC 자료구조는 다양한 라우팅 테이블에 대해 능동적으로 최적의 압축을 제공함으로써 보통의 펜티엄 CPU에서 최대 $12.5{\times}10^5$ LPS(Lookup per second)를 기록하였다.

Keywords

References

  1. V. Fuller, T. Li, J. Yu and K. Varadhan, 'Classless Inter Domain Routing(CIDR): an Address Assignment and Aggregation Strategy,' RFC 1519, IETF, Spt., 1993
  2. Y. Rekhter and T. Li, 'A Border Gateway Protocol 4 (BGP-4),' RFC 1771, IETF, Mar., 1996
  3. A. J. McAuley and P. Francis, Fast routing table lookup using CAMs, Proc. IEEE Infocom '93, San Francisco, 1993 https://doi.org/10.1109/INFCOM.1993.253403
  4. N. Huang and S. Zhao, 'A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers,' IEEE JSAC, Vol.17, No.6, Jun., 1999 https://doi.org/10.1109/49.772440
  5. S. Nilsson and G. Karlsson, 'Fast Address Look-up for Internet Routers,' Proc. of IEEE Broadband Communications '98, Apr., 1998
  6. M. Degermark, A. Brodnik, S. Carlsson and S. Pink, 'Small Forwarding Tables for Fast Routing Lookups,' Proc. of ACM SIGCOMM '97, Oct., 1997 https://doi.org/10.1145/263105.263133
  7. Y-C. Liu and C-T. Lea, 'Fast IP Table Lookup and Memory Reduction,' 2001 IEEE Workshop on High Performance Switching and Routing, 2001 https://doi.org/10.1109/HPSR.2001.923637
  8. P. Gupta, et al., 'Routing Lookups in Hardware at Memory Access Speeds,' Proc. of IEEE Infocom '98, San Francisco, Apr., 1998 https://doi.org/10.1109/INFCOM.1998.662938
  9. E. Rosen, A. Viswanathan and R. Callon, 'Multiprotocol Label Switching Architecture,' RFC 3031, IETF, Jan., 2001
  10. T. Cormen, C. Leiserson and R. Riverst, 'Introduction to Algorithms,' The MIT Press, 1990
  11. S. Nilsson and G. Karlsson, 'Fast Address Lookup for Internet Routers,' Proc. of IEEE Broadband Communication '98, Apr., 1998
  12. G. Gonnet and R. Baeza-Yates, 'Handbook of Algorithms and Data Structures,' 2nd Ed., Addison Wesley, 1991
  13. K. Sklower, 'A Tree-Based Routing Table for Berkeley Unix,' Proc. of the Winter Usenix Conference, 1991
  14. S. Venkatachary and G. Varghese, 'Faster IP Lookups using Controlled Prefix Expansion,' Proc. of ACM Sigmetrics, Sep., 1998 https://doi.org/10.1145/277851.277863
  15. M. Waldvogel, G. Varghese, J. Turner and B. Plattner, 'Scalable High Speed IP Routing Lookups,' Proc. of ACM SIGCOMM '97, Oct., 1997 https://doi.org/10.1145/263105.263136
  16. B. Lampson, V. Srinivasan and G. Varghese, 'IP Lookups using Multiway and Multicolumn Search,' Proc. of INFOCOM, Mar., 1998 https://doi.org/10.1109/90.779199
  17. Torrent Networking Technologies Corporation, 'High-Speed Routing table Search Algorithms,' A technical paper, http://www.torrentnet.com
  18. P. Newman, G. Minshall and L. Huston, 'IP Switching and Gigabit Routers,' IEEE Communications Magazine, Jan., 1997 https://doi.org/10.1109/35.568212
  19. Michigan University and merit Network, Internet Performance Management and Analysis (IPMA) project, http://nic.merit.edu/-ipma