An evaluation of IP-address lookup algorithms

被引：0

作者：

Haider, Aun ^{[1
]}

Sirisena, Harsha ^{[2
]}

Mortensen, Brian B. ^{[3
]}

机构：

[1] Massey Univ, IIST, Palmerston North, New Zealand

[2] Univ Canterbury, Dept Elect & Comp Engn, Christchurch, New Zealand

[3] Tech Univ Denmark, Lyngby, Denmark

来源：

2006 INTERNATIONAL CONFERENCE ON INDUSTRIAL AND INFORMATION SYSTEMS, VOLS 1 AND 2 | 2006年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

Due to the manyfold increase in Internet traffic, backbone links and routers of multigigabit capacity are commonly deployed. One of the major bottlenecks in the optimum performance of such high-speed routers is address lookup while performing longest prefix match. The problem is further compounded by the introduction of 128 bit addresses in IPv6 technology. Due to the importance of the address lookup problem several algorithms have been proposed in recent years. This paper presents an evaluation of state-of-art IP address lookup algorithms. Both software and hardware based algorithms are discussed in terms of space/time complexity, lookup speed, scalability and update overheads.

引用

页码：571 / +

页数：3