Method and apparatus for determining a longest matching prefix f

Details Method and apparatus for determining a longest matching prefix f Method and apparatus for determining a longest matching prefix f

1997-05-06

1999-11-09

Vu, Viet D.

Data processing: database and file management or data structures

Database design

Data structure types

712898, G06F 702

Patent

active

059832231

ABSTRACT:
An arrangement efficiently renders forwarding decisions for a packet using a forwarding database dictionary of an intermediate node configured to optimize space consumed by addresses stored therein as well as to reduce time required to search those addresses. The arrangement generally includes a lookup mechanism comprising a search engine coupled to a set of registers and to the dictionary. The register set, in turn, comprises a number of registers operating in parallel to compare values specified by a number of bits with a predetermined starting point of an input string. The specified values are preferably representative of address prefixes stored in the dictionary and the input string is a destination address of the packet.

REFERENCES:
patent: 5293379 (1994-03-01), Carr
patent: 5546390 (1996-08-01), Stone
patent: 5561421 (1996-10-01), Smith et al.
patent: 5787430 (1998-07-01), Doeringer et al.
Radia Perlman, Interconnections Bridges and Routers, Copyright 1992 by Addison-Wesley Publishing Company, Inc., pp. 233-239.

Affiliated with

Also associated with

Rating

Method and apparatus for determining a longest matching prefix f does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for determining a longest matching prefix f, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for determining a longest matching prefix f will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1469642