IC Design of IPv6 Routing Lookup for High Speed Networks

  • Yuan-Sun Chu
  • Hui-Kai Su
  • Po-Feng Lin
  • Ming-Jen Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3994)


In recent years, there are many researches for routing lookup. Most of them can achieve high average search throughput for IPv4, but they are slow in the updating speed and cannot suit to 128 bits IPv6 address even in hardware architecture. This paper proposed a routing lookup system which contains an ASIC of routing lookup table and off-chip memory sets. In the performance analysis, 91.89 % routing entries of the routing table can be searched in one memory access, and the worst case about 10 % needs two memory accesses. The routing lookup system approaches 213.4 Mlps (109.26 Gb/s). It is enough to satisfy the high speed link OC-768 (40 Gb/s) with 150000 routing entries.


Hash Function Memory Access Hardware Architecture Clock Period Binary Decision Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Sangireddy, R., Somani, A.: High-speed IP routing with binary decision diagrams based hardware address lookup engine. IEEE Journal on Selected Areas in Communications 21, 513–521 (2003)CrossRefGoogle Scholar
  2. 2.
    Lampson, B., Srinivasan, V., Varghese, G.: IP lookups using multiway and multicolumn search. IEEE/ACM Transactions on Networking 7, 324–334 (1999)CrossRefGoogle Scholar
  3. 3.
    Huang, N.F., Zhao, S.M.: A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers. IEEE Journal on Selected Areas in Communications 17, 1093–1104 (1999)CrossRefGoogle Scholar
  4. 4.
    Gamache, B., Pfeffer, Z., Khatri, S.: A fast ternary CAM design for IP networking applications. In: ICCCN 2003 (2003)Google Scholar
  5. 5.
    Wang, Z.X., Wang, H.M., Sun, Y.M.: High-performance IPv4/IPv6 dual-stack routing lookup. In: 18th International Conference on Advanced Information Networking and Applications, vol. 1 (2004)Google Scholar
  6. 6.
    Hayashi, T., Miyazaki, T.: High-speed table lookup engine for IPv6 longest prefix match. In: IEEE Global Telecommunications Conference (GLOBECOM 1999), vol. 2 (1999)Google Scholar
  7. 7.
    The Computer Center of the Ministry of Education in Taiwan: Taiwan academic network (TANET) (2005) (in Chinese),
  8. 8.
    Tanenbaum, A.S., Woodhull, A.S.: Operating Systems: Design And Implementation, 2nd edn. Prentice Hall, Englewood Cliffs (1996)Google Scholar
  9. 9.
    Liu, H.: Reducing cache miss ratio for routing prefix cache. In: IEEE Global Telecommunications Conference (GLOBECOM 2002), vol. 3 (2002)Google Scholar
  10. 10.
    Alghazo, J., Akaaboune, A., Botros, N.: SF-LRU cache replacement algorithm. In: Records of the International Workshop on Memory Technology, Design and Testing, MTDT 2004 (2004)Google Scholar
  11. 11.
    Shyu, W.L., Wu, C.S., Hou, T.C.: Efficiency analyses on routing cache replacement algorithms. In: IEEE International Conference on Communications (ICC 2002), vol. 4 (2002)Google Scholar
  12. 12.
    Wang, J.S., Li, H.Y., Chen, C.C., Yeh, C.: An AND-type match-line scheme for energy-efficient content addressable memories. In: IEEE International Solid-State Circuits Conference, ISSCC (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yuan-Sun Chu
    • 1
  • Hui-Kai Su
    • 1
  • Po-Feng Lin
    • 1
  • Ming-Jen Chen
    • 1
  1. 1.Department of Electrical EngineeringNational Chung-Cheng UniversityChia-YiTaiwan, R.O.C

Personalised recommendations