06396842 is referenced by 32 patents.

A method of searching utilizing a longest match based Radix Search Trie with variable length keys and having the ability to handle keys being prefixes of other keys. The method is based on the well known Patricia search trie algorithm. The address prefixes representing the keys for the tree are modified before being processed by the algorithm. A single byte is added to the beginning of each address prefix which is set equal to the length of the address prefix. The combined address length byte followed by the address prefix is used by the Patricia algorithm . When one address is the prefix of another, the length byte will make both addresses unique and distinct from each other. The conventional Patricia search can now be used since the keys have been made unique. A circular prefix list is maintained in descending numerical order comprising an entry for each distinct value of address length insure that the longest matching address is found.

Method of searching using longest match based Randix Search Trie with variable length keys and having prefix capability
Application Number
Publication Number
6396842 (B1)
Application Date
April 30, 1998
Publication Date
May 28, 2002
Haim Rochberger
Howard Zaretsky
3Com Corporation
H04L 12/28
View Original Source