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
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Memory-efficient state lookups with fast updates
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A Fast IP Lookup Scheme for Longest-Matching Prefix
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
You can get there from here: routing in the internet
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Hi-index | 0.24 |
Most of the existing IP address lookup schemes emphasize the table lookups with little attention to table updates. Updating the routing table often requires a considerable time overhead, especially for gigabit backbone routers. This paper presents a high-speed lookup scheme with a small bounded update time for IP forwarding engines in IP routers. It performs one IP address lookup per memory access by employing memory access pipelining and updates the table in the time bounded by the IP packet interarrival time on a gigabit link, regardless of the size of the database. The resulting design requires manageably small memories to be implemented using current SRAM technology.