Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Two- and three-dimensional point location in rectangular subdivisions
Journal of Algorithms
Trading packet headers for packet processing
IEEE/ACM Transactions on Networking (TON)
Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
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)
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup
SAINT '02 Proceedings of the 2002 Symposium on Applications and the Internet
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
O(log n ) Dynamic Packet Routing
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
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
Data Structures For One-Dimensional Packet Classification Using Most-Specific-Rule Matching
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
IP switching and gigabit routers
IEEE Communications Magazine
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
An evaluation of the key design criteria to achieve high update rates in packet classifiers
IEEE Network: The Magazine of Global Internetworking
Prefix and Interval-Partitioned Dynamic IP Router-Tables
IEEE Transactions on Computers
A B-Tree Dynamic Router-Table Design
IEEE Transactions on Computers
Fast binary and multiway prefix searches for packet forwarding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Segment Trees for Ranges and Prefixes
IEEE Transactions on Computers
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
Build shape-shifting tries for fast IP lookup in O(n) time
Computer Communications
Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updatable Address Set
IEEE Transactions on Computers
New Data Structures for IP Lookup and Conflict Detection
Algorithmics of Large and Complex Networks
IP address lookup for internet routers using balanced binary search with prefix vector
IEEE Transactions on Communications
| Hi-index | 14.99 |
Two versions of the Internet (IP) router-table problem are considered. In the first, the router table consists of n pairs of tuples of the form (p,a), where p is an address prefix and a is the next-hop information. In this version of the router-table problem, we are to perform the following operations: insert a new tuple, delete an existing tuple, and find the tuple with longest matching-prefix for a given destination address. We show that each of these three operations may be performed in O(\log n) time in the worst case using a priority-search tree. In the second version of the router-table problem considered by us, each tuple in the table has the form (r,a), where r is a range of destination addresses matched by the tuple. The set of tuples in the table is conflict-free. For this version of the router-table problem, we develop a data structure that employs priority-search trees as well as red-black trees. This data structure permits us to perform each of the operations insert, delete, and find the tuple with most-specific matching-range for a given destination address in O(\log n) time each in the worst case. The insert and delete operations preserve the conflict-free property of the set of tuples. Experimental results are also presented.