Hybrid longest prefix match and fixed match searches
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Sep 14, 2004
Grant Date -
N/A
app pub date -
Nov 28, 2000
filing date -
Nov 28, 2000
priority date (Note) -
Expired
status (Latency Note)
Importance
Abstract
A method and system for finding a longest matching prefix for an input keyword from among multiple prefixes. The prefixes are data strings of varying lengths wherein prefixes of length n or greater are probabilistically a longest prefix match. The method of the present invention begins by mapping the prefixes of length greater than or equal to n.sub.1, that is, in the interval [n.sub.1, L], into a first lookup system. Remaining prefixes of length less than n.sub.1 but greater than or equal to n.sub.2, that is, in the interval [n.sub.2, n.sub.1 -1], are mapped into a second index utilizing a second hash function, wherein n.sub.2 is less than n.sub.1. Further lookup systems on prefixes having lengths in the intervals [n.sub.3, n.sub.2 -1], [n.sub.4, n.sub.3 -1], and so on, may also be utilized, as determined by optimization studies and the statistics of routing tables.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully