Address lookup in packet data communication networks
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Apr 18, 2000
Grant Date -
N/A
app pub date -
Feb 24, 1998
filing date -
Feb 24, 1998
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
An apparatus for performing an address lookup to find a longest matching prefix for an N-bit input address in a packet data communication system that includes a memory (e.g. RAM) for storing a table containing a predefined portion of an N-bit address with an associated prefix search list containing prefix values that are candidates for the longest matching prefix. A binary search algorithm is used for selecting a specific prefix value from the prefix search list to structure the N-bit input address to form a search value. A search algorithm (e.g. a content addressable memory) is used for performing an associative search on the search value to find the longest matching prefix. The two types of memories (RAM and CAM) each provide specific functions. The RAM is used as a lookup table to provide an N/x-bit (0
Recipient Email Address Recipient Email Address Comment Recipient Email Address 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
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Add to Portfolio(s)
