Journal of the Institute of Electronics Engineers of Korea TC (대한전자공학회논문지TC)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

An Efficient Updating Algorithm for IPv6 Lookup based on Priority-TCAM

IPv6 Lookup을 위한 효율적인 Priority TCAM Table 운영 알고리즘

  • Hong, Seung-Woo (Electronics and Telecommunications Research Institute, ETRI) ;
  • Noh, Sung-Kee (Electronics and Telecommunications Research Institute, ETRI) ;
  • Hong, Sung-Back (Electronics and Telecommunications Research Institute, ETRI) ;
  • Kim, Sang-Ha (Department of Computer Science & Engineering, Chungnam National University)
  • 홍승우 (한국전자통신연구원) ;
  • 노성기 (한국전자통신연구원) ;
  • 홍성백 (한국전자통신연구원) ;
  • 김상하 (충남대학교 공과대학 전기정보통신공학부 컴퓨터)
  • Published : 2007.10.25
Download PDF
⟨ Previous Next ⟩

Abstract

TCAM(Ternary content-addressable memory) has been widely used to perform fast routing lookup. It is able to accomplish the LPM(longest prefix matching) search in O(1) time without considering the number of prefixes and their lengths. As compared to software-based solutions, especially for IPv6, TCAM can oner sustained throughput and simple system architecture. However, There is no research for Priority-TCAM which can assign priority to each memory block. This paper addresses the difference or priority-TCAM compared to the existing TCAM and proposes CAO-PA algerian to manage the lookup table efficiently.

Internet의 빠른 성장으로 인한 IP Address의 고갈과 다양한 Application의 등장으로 Network은 IPv6로의 전환을 필요로 하고 있다. IPv6는 128-bits로 늘어날 주소 체계로 IPv4에 비해 LPM을 위한 Lookup Table의 사이즈도 커질 것이기 때문에 대용량의 Lookup Table를 고속으로 처리하기 위한 방안이 필요하다. 이에 대한 해결책으로 하드웨어 기반의 고속의 TCAM을 사용하여 Lookup 성능을 향상시키려는 연구가 많이 되고 있긴 하지만, 최근 등장하고 있는 Priority-TCAM을 활용한 Lookup Table 구성방법에 대한 연구는 찾아 볼 수 없다. 본 논문에서는 Priority-TCAM과 기존 TCAM의 차이점을 기술하고 Priority-TCAM을 사용하여 효율적으로 Lookup Table을 구성하고 운용할 수 있는 알고리즘을 기술한다.

Keywords

References

  1. Vince F, et al. Classless Inter-Domain Routing (CIDR): an address assignment and aggregation strategy (RFC 15119)
  2. R. Hinden and S. Deering. IP Version 6 Addressing Architecture, RFC 2373
  3. R. Hinden, M.O'Dell, S. Deering, An IPv6 Aggregatable Global Unicast Address Format, July 1998
  4. Devavat Shah, Gupta, P. Fast Updating Algorithms for TCAM. IEEE Micro January/February 2002
  5. Ravikumar V.C, Rabi N. Mahapatra Texas A&M University, TCAM Architecture for IPLookup Using Prefix Properties, IEEE Micro March-April 2004
  6. R. Panigraht and S. Sharma, Reducing TCAM Power Consumption and Increasing Throughput, Proc. 10th Symp, IEEE CS Press, 2002, p.107-112
  7. H.Liu, Routing Table Compaction in Ternary CAM, IEEE Micro, Jan-Feb.2002, vol.22, no.1, pp.58-64
  8. Zhiyong Liang, Jianping Wu, Ke Xu, A TCAM-based IP Lookup Scheme for Multi-nexthop Routing, ICCNMC'03
  9. Kai Zheng, Bin Liu, V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm Benchmark, AINA'06
  10. P. Gupta, S.Lin, and N. McKeown, Routing Lookups in Hardware at Memory Access Speed, Proc. Of IEEE INFOCOM'98, San Francisco, April 1998, pp.1240-1247
  11. Miguel A.Ruiz-Sanchez, Ernst W.Biersack, Walid Dabbous, ,Survey and Taxonomy of IP Address Lookup Algorithms, IEEE Network, March/April 2001
  12. V.Srinivasan and G.Varghese, 'Fast Address Lookups using Controlled Prefix Expansion', Proc,.ACM Sigmetrics'98, Une 1998, pp.1-11