Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable high speed IP routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A Scalable and Small Forwarding Table for Fast IP Address Lookups
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Issues and trends in router design
IEEE Communications Magazine
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop of an incoming IP packet by its destination address. Hence, IP address lookup is an important issue in designing high speed routers. For implementing a fast IP lookup scheme in high speed routers, this paper proposes a distributed architecture of the indirect IP lookup scheme which consists of several IP lookup engines. Also, we propose a simple rule for partitioning route entries among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware support, the proposed scheme can drastically reduce the amount of required memory and the number of memory accesses for constructing the forwarding table.