Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2007-09-25
2007-09-25
To, Doris H. (Department: 2616)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C711S118000
Reexamination Certificate
active
10032379
ABSTRACT:
An advanced data structure allows lookup based upon the most significant 16 bits and the following variable number of K bits of the IP destination address. This 16/K scheme requires less than 2 MB memory to store the whole routing tables of present day backbone routers. A 16/Kc version utilizes bitmaps to compress the table to less than 0.5 MB. For the 16/K data structure each route lookup requires at most 2 memory accesses while the 16/Kc requires at most 3 memory accesses. By configuring the processor properly and developing a few customized instructions to accelerate route lookup, one can achieve 85 million lookups per second (MLPS) in the typical case with the processor running at 200 MHz. Further, the lookup method can be implemented using pipelining techniques to perform three lookups for three incoming packets simultaneously. Using such techniques, 100 MLPS performance can be achieved.
REFERENCES:
patent: 5951651 (1999-09-01), Lakshman et al.
patent: 6018524 (2000-01-01), Turner et al.
patent: 6141738 (2000-10-01), Munter et al.
patent: 6243720 (2001-06-01), Munter et al.
patent: 6341130 (2002-01-01), Lakshman et al.
patent: 6434144 (2002-08-01), Romanov
patent: 6563823 (2003-05-01), Przygienda et al.
patent: 6571313 (2003-05-01), Filippi et al.
patent: 6631419 (2003-10-01), Greene
patent: 6658482 (2003-12-01), Chen et al.
patent: 6697363 (2004-02-01), Carr
patent: 6717946 (2004-04-01), Hariguchi et al.
patent: 6782382 (2004-08-01), Lunteren
patent: 6798777 (2004-09-01), Ferguson et al.
patent: 6963924 (2005-11-01), Huang et al.
patent: 6970462 (2005-11-01), McRae
patent: 6975631 (2005-12-01), Kastenholz
patent: 6980552 (2005-12-01), Belz et al.
patent: 2002/0002549 (2002-01-01), Lunteren
patent: 2002/0080798 (2002-06-01), Hariguchi et al.
patent: 2002/0118682 (2002-08-01), Choe
patent: 2006/0039374 (2006-02-01), Belz et al.
Gupta et al., “Routing Lookups in Hardware at Memory Access Speeds,” IEEE, 1998, pp. 1240-1246.
Chiueh et al., “High-Performance IP Routing Table Lookup Using CPU Caching,” IEEE, 1999, pp. 1421-1427.
Degermark et al., “Small Forwarding Tables for Fast Routing Lookups,” ACM, 1997, pp. 3-13.
Srinivsan et al., “Fast Address Lookups Using Controlled Prefix Expansion,” pp. 1-37.
Huang et al., “A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers,” IEEE Journal on Selected Areas in Communications, vol. 17, No. 6, Jun. 1999, pp. 1093-1104.
Srinivasan, V. et al., “Fast Address Lookups Using Controlled Prefix Expansion”, White paper, p. 1-37.
Carchia Michael
Ji Hongbin
Pillsbury Winthrop et al
Rose Kerri M.
Tensilica, Inc.
To Doris H.
LandOfFree
Fast IP route lookup with 16/K and 16/Kc compressed data... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Fast IP route lookup with 16/K and 16/Kc compressed data..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast IP route lookup with 16/K and 16/Kc compressed data... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3742736