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 IP packet forwarding technique based on a new structure of lookup table
International Journal of Computers and Applications
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 | 0.02 |
[Srinivasan and Varghese 17 ] have proposed the use of multibit tries to represent routing tables used for Internet (IP)address lookups. They propose an O(n * W 2 * k) dynamic programing algorithm to determine the strides for an optimal variable-stride trie that has at most k levels. Here, n is the number of prefixes in the routing table and W is the length of the longest prefix. We improve on this algorithm by providing an alternative dynamic programming formulation. The complexity of our algorithm is O(n * W * k) on real router data sets. This is an improvement by a factor of W over the corresponding algorithm of 17 ]. Experiments conducted by us indicate that our variable-stride algorithm is between 2 and 17 times as fast for IPv4 routing table data.