Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-09-01
2009-12-08
Shah, Chirag G (Department: 2419)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
Reexamination Certificate
active
07630367
ABSTRACT:
A method and algorithm for IP address lookup for packet forwarding, finds a longest prefix match for a destination address of n bits, using 2n/2entries in a lookup table, expanding a given IP address to be matched if its prefix length is more than n/2, and, completing a lookup operation using the table. The number ‘n” may be 32 or otherwise. An example teaches an IP address lookup table with a maximum address size of 32 bits, using a lookup table with 216entries. Further, if an IP prefix length is more than 16 bits, then the given address to be matched is expanded to its full prefix length before the lookup operation. The algorithm takes only two memory references for specific hardware, such as IXP1200. For generic hardware, it takes only three memory references. Also taught is a computer readable medium having the method encoded therein.
REFERENCES:
patent: 2004/0236720 (2004-11-01), Basso et al.
patent: 2004/0255045 (2004-12-01), Lim et al.
Global IP Services PLLC
Nama Prakash
Shah Chirag G
WIPRO Limited
Zhou Yong
LandOfFree
Approach for fast IP address lookups does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Approach for fast IP address lookups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approach for fast IP address lookups will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4066920