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
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup
SAINT '02 Proceedings of the 2002 Symposium on Applications and the Internet
Biased Skip Lists for Highly Skewed Access Patterns
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
IP Address Lookup Made Fast and Simple
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Sublogarithmic searching without multiplications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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)
Longest prefix matching using bloom filters
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup
FTDCS '01 Proceedings of the 8th IEEE Workshop on Future Trends of Distributed Computing Systems
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
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
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Prefix and Interval-Partitioned Dynamic IP Router-Tables
IEEE Transactions on Computers
Adaptive data structures for IP lookups
Journal of Experimental Algorithmics (JEA)
A B-Tree Dynamic Router-Table Design
IEEE Transactions on Computers
Dynamic pipelining: making IP-lookup truly scalable
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic IP router-tables using highest-priority matching
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Scalable IP lookup for Internet routers
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
IP address lookup is a critical operation for high-bandwidth routers in packet-switching networks, such as Internet. The lookup is a nontrivial operation, since it requires searching for the longest prefix, among those stored in a (large) given table, matching the IP address. Ever increasing routing table size, traffic volume, and links speed demand new and more efficient algorithms. Moreover, the imminent move to IPv6 128-bit addresses will soon require a rethinking of previous technical choices. This article describes a the new data structure for solving the IP table lookup problem christened the adaptive stratified tree (AST). The proposed solution is based on casting the problem in geometric terms and on repeated application of efficient local geometric optimization routines. Experiments with this approach have shown that in terms of storage, query time, and update time the AST is at a par with state of the art algorithms based on data compression or string manipulations (and often it is better on some of the measured quantities).