• DocumentCode
    1827218
  • Title

    Efficient IP routing table VLSI design for multigigabit routers

  • Author

    Chang, Robert C. ; Lim, Beng-Huat

  • Author_Institution
    Dept. of Electr. Eng., Nat. Chung-Hsing Univ., Taichung, Taiwan
  • Volume
    2
  • fYear
    2002
  • fDate
    2002
  • Abstract
    The routing table lookup becomes a great bottleneck when multi-gigabit links are required in today´s network routers. Hence, we propose a lookup scheme that can efficiently handle IP routing lookup, insertion and deletion inside the routing table. By introducing memory reduction and the novel skip function, we have successfully reduced the required memory size to about 0.59 Mbytes. The routing table VLSI design was carried out. It can achieve one route lookup for every memory access using pipeline implementation. Timemill post-layout simulation results show that the chip can furnish approximately 30×106 lookups/s, and thus it can support up to 30 Gbits/s link speed when the frame size is 1000 bits. In addition, our design can be easily scaled from IPv4 to IPv6.
  • Keywords
    VLSI; circuit layout CAD; circuit simulation; industrial property; integrated circuit layout; network routing; pipeline processing; table lookup; 0.59 Mbyte; 30 Gbit/s; IP routing lookup; IP routing table VLSI design; IPv4; IPv6; Timemill post-layout simulation results; Verilog code; frame size; memory reduction; memory size reduction; multigigabit routers; physical layout; pipeline implementation; skip function; Fluctuations; Hardware; Memory management; Packet switching; Pipelines; Protocols; Random access memory; Routing; Table lookup; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
  • Conference_Location
    Phoenix-Scottsdale, AZ
  • Print_ISBN
    0-7803-7448-7
  • Type

    conf

  • DOI
    10.1109/ISCAS.2002.1011468
  • Filename
    1011468