Fast IP routing lookup scheme

Pi Chung Wang*, Chia Tai Chan, Yaw-Chung Chen


研究成果: Paper同行評審

16 引文 斯高帕斯(Scopus)


A major design issue for the next generation routers is the IP lookup mechanism. The router needs to perform a longest prefix matching on the address lookup for each incoming packet to determine the next hop. Currently, the process is done in software and has become a major performance bottleneck of the router. In this paper, we propose a fast IP lookup mechanism in which the forwarding table is small enough to fit in SRAM with very low cost. It also can be implemented in hardware using the pipeline technique. A large routing table with 45,000 routing prefixes can be compressed to a forwarding table with about 430 Kbytes in size by using our proposed method. In the worst case, the number of memory accesses for a lookup is three. When implemented in pipeline technique, the proposed mechanism can achieve one routing lookup per memory access. With current 10 ns SRAM, this mechanism provides approximately 100 million routing lookups per second. Furthermore, the lookup speed can be improved linearly through the speedup of the memory access.

出版狀態Published - 18 6月 2000
事件2000 IEEE International Conference on Communications - New orleans, LA, USA
持續時間: 18 6月 200022 6月 2000


Conference2000 IEEE International Conference on Communications
城市New orleans, LA, USA


深入研究「Fast IP routing lookup scheme」主題。共同形成了獨特的指紋。