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
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers
IEEE Journal on Selected Areas in Communications
A novel reconfigurable hardware architecture for IP address lookup
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
Low power fast and dense longest prefix match content addressable memory for IP routers
Proceedings of the 14th ACM/IEEE international symposium on Low power electronics and design
A pipelined routing lookup scheme with fast updates
Computer Communications
| Hi-index | 0.00 |
One of the key design issues for the next generation IP routers is the IP Lookup mechanism.IP lookup is an important action in router that is to find the next hop of each incoming packet with a longest-prefix-match address in the routing table.In this paper, we propose an IP lookupmechanism with the number of memory access for an IP lookup being one in the best case and being four in the worst case.The forwarding table needed by our mechanism issmall enough to fit in the SRAM.For example, a largerouting table with 40000 routing entries can be compacted to a forwarding table of 260Kbytes in our scheme.