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
IEEE/ACM Transactions on Networking (TON)
Fast address lookups using controlled prefix expansion
ACM Transactions on Computer Systems (TOCS)
IP lookups using multiway and multicolumn search
IEEE/ACM Transactions on Networking (TON)
Efficient Construction of Variable-Stride Multibit Tries for IP Lookup
SAINT '02 Proceedings of the 2002 Symposium on Applications and the Internet
IP Address Lookup Made Fast and Simple
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A Fast Table Update Scheme for High-Performance IP Forwarding
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Modified LC-Trie Based Efficient Routing Lookup
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
An O(log n) Dynamic Router-Table Design
IEEE Transactions on Computers
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
Prefix and Interval-Partitioned Dynamic IP Router-Tables
IEEE Transactions on Computers
A B-Tree Dynamic Router-Table Design
IEEE Transactions on Computers
An On-Chip IP Address Lookup Algorithm
IEEE Transactions on Computers
A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 14.98 |
Dynamic IP router table schemes, proposed in the literature, perform an IP lookup or an on-line prefix update in O(log n) memory accesses. In term of lookup time, they are still slower than FEC (CNHA/CWA) scheme, which requires exactly (at most) three memory accesses for each lookup, irrespective of the number of prefixes n. The prefix update in FEC (CNHA/CWA) has a drawback: Off-line solutions need structure reconstruction, or implementing on-line prefix updates is difficult. This paper solves this problem. We propose the use of lexicographic ordered prefixes to reduce off-line construction time. Simulations on several real routing databases, run on the same platform, show that our approach constructs FEC (CNHA/CWA) tables in 2.56 to 7.74 (1.56 to 2.7) times faster than that from previous techniques. Our on-line update scheme uses an updatable-address-set and selectively decompresses the FEC and CNHA/CWA structures to modify only the next-hops of the addresses in the set. Recompressing the updated structures, the resulting tables are identical to what would have been obtained by structure reconstructions, but at much lower computational cost. Our on-line update for FEC (CNHA/CWA) scheme takes at most 10.1 (7.21) -脻s, which is of same order as achieved by the recently proposed schemes.