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 prefix matching
ACM Transactions on Computer Systems (TOCS)
Neural Network Based Algorithms for IP Lookup and Packet Classification
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Fast address look-up for internet routers
BC '98 Proceedings of the IFIP TC6/WG6.2 Fourth International Conference on Broadband Communications: The future of telecommunications
IP route lookups as string matching
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Longest prefix matching using bloom filters
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An O(log n) Dynamic Router-Table Design
IEEE Transactions on Computers
Multiway range trees: scalable IP lookup with fast updates
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tree bitmap: hardware/software IP lookups with incremental updates
ACM SIGCOMM Computer Communication Review
A pipelined routing lookup scheme with fast updates
Computer Communications
High-performance IP forwarding with efficient routing-table update
Computer Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Routing in the Internet is performed with the help of IP forwarding lookup tables; however, searching these tables efficiently for the “next hop” is nontrivial, and complex data structures make an important contribution in this regard. This article surveys the three main approaches to the problem and investigates the associated data structures and algorithms. We also explore variations on these approaches and conclude with a discussion of current trends.