DOI QR코드

DOI QR Code

Enhanced Bitmap Lookup Algorithm for High-Speed Routers

고속 라우터를 위한 향상된 비트맵 룩업 알고리즘

  • 이강우 (동국대학교 정보통신공학과) ;
  • 안종석 (동국대학교 컴퓨터공학과)
  • Published : 2004.04.01

Abstract

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.

인터넷 회선의 고속화에 따라 패킷을 초당 기가비트 이상의 속도로 전송하는 라우터에 대한 연구가 활발하다. 본 논문에서는 라우터의 병목인 최장 프리픽스 검색(LPM : longest prefix matching)을 효율적으로 수행하기 위해 제안된 비트맵 트라이(Bitmap Trie) 알고리즘을 혁신적으로 향상시킨 방법을 제시한다. 이 방법은 검색시간을 단축하기 위하여 다음과 같은 세 가지 기법을 적용하였다. 첫째, 카운트 테이블을 추가하여 기존 알고리즘에서의 과도한 시프트 연산을 제거하여 프로세서 내의 처리시간을 단축했다. 두 번째는 트랜스퍼 테이블내의 중복된 포워딩 정보를 제거하여 메모리 효율을 증가시켰으며, 마지막으로, 포워딩 정보에 대한 접근빈도에 따라 검색범위를 다원화하여 데이터 접근을 최적화하였다. 또한, 신뢰도가 가장 놀은 실행-구동 시뮬레이션 방법을 채택함으로써 검색의 지연요소를 발생 원인별로 세분하여 알고리즘이 실행되는 과정을 면밀하게 분석할 수 있었다. 실험 결과는 실제 시스템으로부터 실측한 결과와 비교하는 검증과정을 거쳤으며, 그 결과 기존 알고리즘에 비해 검색 수행시간을 약 82% 단축한 알고리즘을 개발하였다.

Keywords

References

  1. A. V. Aho, J. E. Hopcrof and J. D. Ullman, 'Data Structures and Algorithms,' Addison-Wesley Pub Co, pp.17-18, pp.78-81, Jan., 1983
  2. L. Bhuyan and H. Wang, 'Execution-Driven Simulation of IR Router Architectures,' NCA2001. IEEE International Symposium, pp.8-10, Oct., 2001
  3. I. L. Chvets and M. H. MacGreaor, 'Multi-zone caches for accelerating IP routing table lookups,' In Proc. High Performance Switching and Routing, pp.121-126, Jun., 2002 https://doi.org/10.1109/HPSR.2002.1024220
  4. M. Degermark, et al., 'Small Forwarding Tables for Fast Routing Lookups,' In Proc. ACM SIGCOMM '97, pp.3-14, Oct., 1997 https://doi.org/10.1145/263109.263133
  5. W. Eatherton, Z. Dittia, G. Varghese, 'Tree Bitmap : Hardware/Software IP Lookups with Incremental Updates,' Thesis, Washington 'University in St. Louis,' pp.7-10, 1998
  6. S. Karlin, L. Peterson 'VERA : An Extensible Router Architecture,' IEEE OPENARCH01, pp.3-14, Apr., 2001
  7. B. Lampson, V. Strinivasan and G. Varghese, 'IP Lookups using Multiway and Multicolumn Search,' IEEE/ACM Transactions on Networking, Vol.7, No.3, pp.324-334, Jun., 1999 https://doi.org/10.1109/90.779199
  8. A. J. McAuley, P. Francis. 'Fast routing table lookup using CAMs,' In Proceedings of the Conference on Computer Communications, Vol.3, pp.1382-1391, Mar.-Apr., 1993 https://doi.org/10.1109/INFCOM.1993.253403
  9. D. R. Morrison, 'PATRICLA-Practical Algorithm to Retreive Information Coded In Alfanumeric,' Journal of the ACM, pp.514-534, Oct., 1968
  10. A. McAuley, P. Tsuchiya, D. Wilson, 'Fast multilevel hierarchical routing table using contentaddressable memory,' U. S. Patent Serial Number, 034444, Dec., 1995
  11. S. Nilsson, G. Karlsson, 'Fast address lookup for Internet routers,' In Proc. IEEE Broadband Communications, pp.5-8, Apr., 1998
  12. S. Oh, J. Ahn, 'Bit-Map Trie : A Data Structure for Fast Forwarding Lookups,' GlobeCom, pp. 1872-1876, 2001 https://doi.org/10.1109/GLOCOM.2001.965899
  13. M. A. Ruiz-Sanchez, E. W. Biersack and Walid Dabbous, 'Survey and taxonomy of IP address lookup algorithms,' IEEE Network, Vol.15, Issue 2, pp.8-23, Mar.-Apr., 2001 https://doi.org/10.1109/65.912716
  14. A. Sharma, 'Augmint-A Multiprocessor Simulation Environment for Intel x86 architectures,' Technical report, University of Illinois at Urbana-Champaign, Mar., 1996
  15. S.Venkatachary and G.Varghese, 'Faster IP Lookups using Controlled Prefix Expansion,' In Proc. of ACM Sigmetrics '98, pp.1-10, June, 1998 https://doi.org/10.1145/277851.277863
  16. M. Waldvogel, G. Varglese, J.Turner, B. Plattner, 'Scalable High Speed IP Routing Lookups,' In Proc. of ACM SIGCOMM '97, pp.5-9, 1997 https://doi.org/10.1145/263109.263136
  17. The Architecture Design for a Ten Terabit IP Switch Router,' In Proc. IEEE Workshop on High performance Switching and Routing (HPSR2001), pp.358-362, May, 2001 https://doi.org/10.1109/HPSR.2001.923661
  18. IPMA(Internet Performance Measurement and Analysis), http://www.merit.edu/ipma/routing_table