We show that two data structures min augmented range tree and priority search pennant efficiently support all the required operations for updatable IP router tables and argue that both structures are better suited for the one dimensional dynamic IP lookup problem than the priority search tree (PST) used in a previous solution. It is possible to maintain both structures in time O(1) after a rotation while PST with n elements may require Omega(log n) steps for a single rotation. Therefore the proposed structures can be balanced using a larger class of rebalancing schemes compared to PST. Both structures are also of interest independently of the IP lookup problem and may be used as attractive implementations of priority search queues in other contexts as well.
|Journal||International Journal of Foundations of Computer Science|
|Publication status||Published - 2007|