Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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
IEEE/ACM Transactions on Networking (TON)
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
Data Structures, Algorithms and Applications in Java
Data Structures, Algorithms and Applications in Java
Fundamentals of Data Structures in C++
Fundamentals of Data Structures in C++
Introduction to Algorithms
Fast Updating Algorithms for TCAMs
IEEE Micro
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
Dynamic Algorithms with Worst-Case Performance for Packet Classification
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
O(log n ) Dynamic Packet Routing
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
O(log n) Dynamic Router-Tables For Ranges
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
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
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
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
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
An efficient IP address lookup algorithm based on a small balanced tree using entry reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic routing tables using simple balanced search trees
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Hi-index | 14.99 |
We develop an enhanced interval tree data structure that is suitable for the representation of dynamic IP router tables. Several refinements of this enhanced structure are proposed for a variety of IP router tables. For example, the data structure called BOB (binary tree on binary tree) is developed for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the highest-priority rule that matches a destination address may be found in O(\log ^2 n) time; a new rule may be inserted and an old one deleted in O(\log n) time. For general ranges, the data structure CBOB (compact BOB is proposed). For the case when all rule filters are prefixes, the data structure PBOB (prefix BOB) permits highest-priority matching as well as rule insertion and deletion in O(W) time, where W is the length of the longest prefix, each. When all rule filters are prefixes and longest-prefix matching is to be done, the data structure LMPBOB (longest matching-prefix BOB) permits longest-prefix matching in O(W) time; rule insertion and deletion each take O(\log n) time. On practical rule tables, BOB and PBOB perform each of the three dynamic-table operations in O(\log n) time and with O(\log n) cache misses. The number of cache misses incurred by LMPBOB is also O(\log n). Experimental results also are presented.