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)
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++
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
O(\log n) Dynamic Router-Tables for Prefixes and Ranges
IEEE Transactions on Computers
Enhanced Interval Trees for Dynamic IP Router-Tables
IEEE Transactions on Computers
Packet classification consuming small amount of memory
IEEE/ACM Transactions on Networking (TON)
A B-tree dynamic router-table design
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
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
| Hi-index | 14.99 |
Two schemes驴prefix partitioning and interval partitioning驴are proposed to improve the performance of dynamic IP router-table designs. While prefix partitioning applies to all known dynamic router-table designs, interval partitioning applies to the alternative collection of binary search tree designs of Sahni and Kim [18]. Experiments using public-domain IPv4 router databases indicate that one of the proposed prefix partitioning schemes驴TLDP驴results in router tables that require less memory than when prefix partitioning is not used. Further significant reduction in the time to find the longest matching-prefix, insert a prefix, and delete a prefix is achieved.