Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup

Authors:
S. Sahni;K. Kim
Affiliations:
-;-
Venue:
FTDCS '01 Proceedings of the 8th IEEE Workshop on Future Trends of Distributed Computing Systems
Year:
2001

Citing 0
Cited 7

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
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Srinivasan and Varghese [16] have proposed the useof multibit tries to represent routing tables used for Internet (IP)address lookups.They propose an O(k*W2)time dynamic programming algorithm to determine thestrides of an optimal k-level multibit fixed-stride triewhen the longes prefix in the routing table has lengthW.We improve on this algorithm by providing analternative dynamic programming formulation.Whilethe asymptotic complexity of the resulting algorithm forfixed-stride tries is the same as that of the algorithm of[16], experiments using real IPv4 routing table data indicatethat our algorithm runs 2 to 4 times as fast.