Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-04-11
2006-04-11
Yao, Kwang Bin (Department: 2667)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
Reexamination Certificate
active
07027445
ABSTRACT:
An apparatus and method for reducing a number of matched entries to more relevant matched entries. In routers, a destination Internet Protocol address of an incoming packet is matched to a router table of Internet Protocol address prefixes, yielding multiple matching entries in the router table. Less relevant matching entries that contain shorter Internet Protocol address prefixes are automatically removed, leaving only the entry including a longest matching prefix.
REFERENCES:
patent: 6065064 (2000-05-01), Satoh et al.
patent: 6449256 (2002-09-01), Varghese et al.
patent: 6570877 (2003-05-01), Kloth et al.
patent: 6614789 (2003-09-01), Yazdani et al.
patent: 6625662 (2003-09-01), Satoh et al.
patent: 6711623 (2004-03-01), Furukawa et al.
GUPTA, “Routing Lookups in Hardware at Memory Access Speeds”, Proceedings of the IEEE Infocom 98, Apr. 1998.
Sunada Dwight
Yuan Xuejun
Park Vaughan & Fleming LLP
SUN Microsystems Inc.
Yao Kwang Bin
LandOfFree
Apparatus and method for finding the longest matching prefix... 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 finding the longest matching prefix..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for finding the longest matching prefix... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3584172