A parallel IP lookup algorithm for terabit router

被引：0

作者：

Zheng, K ^{[1
]}

Lu, HB ^{[1
]}

Liu, B ^{[1
]}

机构：

[1] Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China

来源：

2003 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOL 1 AND 2, PROCEEDINGS | 2003年

关键词：

IP address; lookup; terabit router;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

IP address lookup is a key bottleneck for high performance routers because they need to find the longest matching prefix. With traditional memory organization, core routers can hardly improve their performance much with the restriction of memory accessing speed. By analyzing the statistical attribution of the IP prefixes, this paper presents a novel parallel IP lookup algorithm based on a new memory organization, which can achieve much higher throughput rate while keeping the memory consumption unchanged. With current 5ns SRAM the proposed mechanism furnishes approximately 600 million routing lookups per second.

引用

页码：478 / 481

页数：4