Scalable IP Routing Lookup in Next Generation Network

  • Chia-Tai Chan
  • Pi-Chung Wang
  • Shuo-Cheng Hu
  • Chung-Liang Lee
  • Rong-Chang Chen
Conference paper

DOI: 10.1007/978-3-540-45235-5_5

Volume 2662 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chan CT., Wang PC., Hu SC., Lee CL., Chen RC. (2003) Scalable IP Routing Lookup in Next Generation Network. In: Kahng HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg

Abstract

Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering the number of prefixes and its lengths. As compared to the software-based solutions, the Ternary content-addressable memory can offer sustained throughput and simple system architecture. It is attractive for IPv6 routing lookup. However, it also comes with several shortcomings, such as the limited number of entries, expansive cost and power consumption. Accordingly, we propose an efficient algorithm to reduce the required size of Ternary content-addressable memory. The proposed scheme can eliminate 98 percentage of Ternary content-addressable memory entries by adding tiny DRAM. We also address related issues in supporting IPv6 anycasting.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Chia-Tai Chan
    • 1
  • Pi-Chung Wang
    • 1
  • Shuo-Cheng Hu
    • 2
  • Chung-Liang Lee
    • 1
  • Rong-Chang Chen
    • 3
  1. 1.Telecommunication LaboratoriesChunghwa Telecom Co., Ltd.TaipeiTaiwan , R.O.C.
  2. 2.Department of Info. ManagementMing-Hsin University of Science and TechnologyHsinchuTaiwan , R.O.C.
  3. 3.Department of Logistics Engineering and ManagementNational Taichung Institute of TechnologyTaichungTaiwan , R.O.C.