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
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers
IEEE Journal on Selected Areas in Communications
Optimal XOR hashing for a linearly distributed address lookup in computer networks
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Optimal XOR hashing for non-uniformly distributed address lookup in computer networks
Journal of Network and Computer Applications
On designing fast nonuniformly distributed IP address lookup hashing algorithms
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
The Internet is growing very rapidly in both the size and the amount of traffic. This gowth has placed excessive strain on the Internet infrastructure, especially on routers. The IP address lookup is the operation that searches the longest matching prefix for the destination address of an incoming packet in order to determine the next hop of the packet. This operation is complex and is a major bottleneck in high-performance routers. In this paper, we propose a fast and updatable lookup scheme that can be easily implemented in hardware. We also present the memory allocation policy that supports for the incremental update of the forwardingtable. Since our lookup scheme can be implemented with the small-bit logic and SRAM, the average delay per one lookup is about 18ns. That is, our scheme can achieve 55.56x106 routing lookups/s in average.