High speed variable length best match look-up in a switching dev

Details High speed variable length best match look-up in a switching dev High speed variable length best match look-up in a switching dev

1996-12-16

1999-06-01

Ton, Dang

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

370408, H04J 324

Patent

active

059094400

ABSTRACT:
A method and apparatus for looking up a key associated with a packet to determine a route through a routing device, the method including, upon receipt of a key, forward traversing one or more nodes which make up a trie stored in a memory by evaluating at each node traversed a bit in the key as indicated by a bit-to-test indicator associated with each node. A value of the bit in the key determining the path traversed along the trie. The method includes locating an end node having a route and comparing the route to the key. If they match, destination information associated with the end node is outputted to guide the transfer of the packet through the routing device. If they do not match, the trie is traversed backwards to locate a best match for the key.

REFERENCES:
patent: 5130983 (1992-07-01), Heffner
patent: 5384568 (1995-01-01), Grinberg et al.
patent: 5448702 (1995-09-01), Garcia, Jr. et al.
patent: 5491694 (1996-02-01), Oliver et al.

Affiliated with

Also associated with

Rating

High speed variable length best match look-up in a switching dev does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with High speed variable length best match look-up in a switching dev, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High speed variable length best match look-up in a switching dev will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-959944