標題: A fast IP routing lookup scheme
作者: Wang, PC
Chan, CT
Chen, YC
資訊工程學系
Department of Computer Science
關鍵字: Internet;gigabit networking
公開日期: 2000
摘要: A major design issue for the next generation routers is the 1P 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 ions SRAM, this mechanism provides approximately 100 million routing lookups per second. Futhermore, the lookup speed can be improved linearly through the speedup of the memory access.
URI: http://hdl.handle.net/11536/19177
ISBN: 0-7803-6283-7
ISSN: 1550-3607
期刊: ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS
起始頁: 1140
結束頁: 1144
Appears in Collections:Conferences Paper