Two versions of the Internet (IP) router-table problem are considered. In the first, the router
table consists of n pairs of tuples of the form (p, a), where p is an address prefix and a is the
next-hop information. In this version of the router-table problem, we are to perform the
following operations: insert a new tuple, delete an existing tuple, and find the tuple with
longest matching-prefix for a given destination address. We show that each of these three
operations may be performed in O (log n) time in the worst case using a priority-search tree …

4,251,861 A 2/1981 Mago 4,833,468 A 5, 1989 Larson et al. 5,546,390 A* 8/1996
Stone......................... 370,408 5,555.405 A 9, 1996 Griesmer et al. 5,701.467 A 12/1997
Freeston 5,787,430 A 7/1998 Doeringer et al. 5,909,440 A 6/1999 Ferguson et al. 5,978,795
A* 1 1/1999 Poutanen et al................ 707/3 6,018,524. A 1/2000 Turner et al. 6,021,131 A
2/2000 Even 6,041,053 A 3, 2000 Douceur et al.