06011795 is referenced by 250 patents and cites 12 patents.

Many network protocols, including the Internet, have addresses that are structured hierarchically. The hierarchy is expressed by an address prefix P that represents all addresses in the given hierarchical level that starts with prefix P. The hierarchy is not strict and can be overridden by more inclusive hierarchies. This is achieved by having network routers find the longest prefix that matches a destination address in a message.

The disclosed invention describes a method and apparatus for implementing controlled expansion: for expanding a set of prefixes into an equivalent (possibly larger) set of prefixes that have a smaller set of prefix lengths. The new set of prefixes can then be looked up significantly faster using any technique whose speed improves by reducing the number of prefix lengths. Our invention also incorporates fast techniques to insert and delete new prefixes, and a technique of pointer hoisting to halve the memory READs needed for trie search. Our solution to longest matching prefix also applies to other routing protocols such as OSI Routing, call routing in telephone networks, and to string matching problems.

Title
Method and apparatus for fast hierarchical address lookup using controlled expansion of prefixes
Application Number
8/821100
Publication Number
6011795
Application Date
March 20, 1997
Publication Date
January 4, 2000
Inventor
Srinivasan Venkatachary
University City
MO, US
George Varghese
St. Louis
MO, US
Agent
Howell & Haferkamp L C
Assignee
Washington University
MO, US
IPC
H04L 12/46
View Original Source