Forwarding engine for fast routing lookups and updates

Author

Yu, Daxiao ; Smith, Brandon C. ; Wei, Belle

Author_Institution

Dept. of Electr. Eng., San Jose State Univ., CA, USA

Volume

2

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

1556

Abstract

The IP address lookup is a bottleneck for a gigabit router as the router needs to find the longest matching prefix (BMP) for the address. Our hash-based design allocates hashed keys among memory modules based on their statistics to minimize hash collisions and facilitate parallel table lookup. It requires 1.5 Mbyte-memory for a 42156-entry routing table. The table lookup speed is 20 ns for a 24-bit prefix and update speed is 25 ns, given 5 ns for a 1280-byte SRAM module. The design is scalable with respect to the number of router interfaces, and can be easily extended to IPv6

Keywords

SRAM chips; cryptography; file organisation; modules; table lookup; telecommunication network routing; transport protocols; 1.5 MByte; 1280 byte; 20 ns; 24 bit; 25 ns; 5 ns; IPv6; Internet protocol; SRAM module; address; fast routing lookups; fast routing updates; forwarding engine; gigabit router; hash collisions minimisation; hash-based design; hashed keys allocation; longest matching prefix; memory modules; parallel table lookup; router interfaces; statistics; table lookup speed; update speed; Hardware; Internet; Protocols; Random access memory; Routing; Search engines; Spine; Statistical distributions; Statistics; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1999. GLOBECOM '99

Conference_Location

Rio de Janeireo

Print_ISBN

0-7803-5796-5

Type

conf

DOI

10.1109/GLOCOM.1999.830041

Filename

830041