	US 7,523,218 B1
	O(log n) dynamic router tables for prefixes and ranges
Sartaj Kumar Sahni, Gainesville, Fla. (US); and Haibin Lu, Gainesville, Fla. (US)
Assigned to University of Florida Research Foundation, Inc., Gainesville, Fla. (US)
Filed on Apr. 30, 2003, as Appl. No. 10/426,423.
Claims priority of provisional application 60/376853, filed on Apr. 30, 2002.
Int. Cl. G06F 15/173 (2006.01)

U.S. Cl. 709—238 [709/239; 709/240; 709/241; 709/242; 709/243; 709/244]

12 Claims

1. A method for matching, inserting, or deleting rules in dynamic routing tables in O(log n) time comprising applying at least one priority search tree to represent at least one dynamic routing table; mapping in 2-dimensional space a set of ranges R wherein each range represents a rule to provide at least one point set, transforming the map so that every point set on the map is unique; and representing the transformed map as a first priority search tree (PST1), wherein the point set comprises points x and y, and wherein the transformation of the point set is performed according to the following formulas: (x,y)∈P.transform1(x,y)=(x′,y′)=(2^Wx−y+2^W−1,y), and transform1(P)={transform1(x,y)|(x,y)∈P}; wherein P is the point set and W is the number of bits in the destination.