Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-04-26
2009-11-03
Sefcheck, Gregory B (Department: 2419)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C709S245000
Reexamination Certificate
active
07613189
ABSTRACT:
A network switch includes a matching device that employs a first data structure to select one of N address groups including a first partial address of an IP packet. An action table selects one of a next hop location corresponding to a longest prefix match and a first matching operation for the IP packet based on the selected one of the N groups. When the first matching operation is selected, the matching device employs a second data structure to select one of M address groups including a second partial address of the IP packet. The action table selects one of a next hop location corresponding to a longest prefix match and a second matching operation for the IP packet based on the selected one of the M groups. A routing engine routes the IP packet based on the first and second next hop locations.
REFERENCES:
patent: 6631419 (2003-10-01), Greene
patent: 6697363 (2004-02-01), Carr
Arad Carmi
Bishara Nafea
Kopelman Yaniv
Mahmoudzadeh Nima
Marvell Israel (M.I.S.L.) Ltd.
Sefcheck Gregory B
LandOfFree
Apparatus and method for efficient longest prefix match lookup does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Apparatus and method for efficient longest prefix match lookup, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for efficient longest prefix match lookup will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4108561