Methods and systems for fast binary network address lookups...

Details Methods and systems for fast binary network address lookups... Methods and systems for fast binary network address lookups...

2005-08-23

2005-08-23

Pezzlo, John (Department: 2662)

Multiplex communications

Data flow congestion prevention or control

C370S389000, C370S477000, C707S793000

Reexamination Certificate

active

06934252

ABSTRACT:
Methods and systems for using binary searches for variable length network address prefix lookups are disclosed. Variable length prefixes are stored in a network address forwarding table. Each prefix corresponds to an entry in the forwarding table. The entries correspond to nodes in a binary tree. Each entry in the forwarding table includes path information regarding parent nodes of each entry in the binary tree. When a lookup is performed in the routing table, bits in the path information are used to determine the longest parent node prefix that matches the address being searched. The longest parent node prefix corresponds to the longest matching prefix.

REFERENCES:
patent: 6047283 (2000-04-01), Braun
patent: 6052683 (2000-04-01), Irwin
patent: 6067574 (2000-05-01), Tzeng
patent: 6266706 (2001-07-01), Brodnik et al.
patent: 6385649 (2002-05-01), Draves et al.
patent: 6434115 (2002-08-01), Schwartz et al.
patent: 6522632 (2003-02-01), Waters et al.
patent: 6539369 (2003-03-01), Brown
patent: 6614789 (2003-09-01), Yazdani et al.
patent: 6654760 (2003-11-01), Baskins et al.
patent: 6665297 (2003-12-01), Hariguchi et al.
patent: 6842443 (2005-01-01), Allen et al.
patent: 2002/0107893 (2002-08-01), Ohkouchi et al.
patent: 2002/0118682 (2002-08-01), Choe
patent: 2002/0129086 (2002-09-01), Garcia-Luna-Aceves et al.
patent: 2002/0172203 (2002-11-01), Ji et al.
patent: 2003/0026246 (2003-02-01), Huang et al.
patent: 2003/0061227 (2003-03-01), Baskins et al.
patent: 2003/0081554 (2003-05-01), Huang et al.
patent: 2003/0091043 (2003-05-01), Mehrotra et al.
patent: 2003/0123459 (2003-07-01), Liao
patent: 2003/0174717 (2003-09-01), Zabarski et al.
patent: 2004/0008634 (2004-01-01), Rangarajan et al.
patent: 2004/0105422 (2004-06-01), Sahni et al.
International Preliminary Examination Report for PCT Application No. 03/29279 (Aug. 16, 2004).
O'Dell, “Internet Host and Traffic Growth,” http://www.cs.columbia.edu/hgs/internet/growth.html, p. 1-5, (Jun. 2001).
Chiueh et al., “Cache Memory Design for Network Processors,” Proceedings of Sixth International Symposium on High-Performance Computer Architecture, p. 409-418, (2000).
Yazdani et al., “Fast and Scalable Schemes for the IP Address Lookup Problem,” Proceedings IEEE Conference on High Performance Switching and Routing, p. 83-92, (2000).
McKeown et al., “High Performance Switches and Routers: Theory and Practice,” Hot Interconnects Tutorial Slides (http://tiny-tera.stanford.edu
ickm/talks/index.html), p. 1-126, (Aug. 20, 1999).
Huang et al., “A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers,” IEEE Journal on Selected Areas in Communications, p. 1093-1104, (Jun. 1999).
Nilsson et al., “IP-Address Lookup Using LC-Tries,” IEEE Journal on Selected Areas in Communications, p. 1083-1092, (Jun. 1999).
Chiueh et al., “High-Performance IP Routing Table Lookup Using CPU Caching,” Proceedings IEEE INFOCOM'99, p. 1421-1428, (1999).
Gupta et al., “Routing Lookups in Hardware at Memory Access Speeds,” Proceedings IEEE INFOCOM'98, p. 1240-1247, (1998).
Lampson et al., “IP Lookups Using Multiway and Multicolumn Search,” Proceedings IEEE INFOCOM'98, p. 1248-1256, (1998).
Degermark et al., “Small Forwarding Tables for Fast Routing Lookups,” Proceedings ACM SIGCOMM, p. 3-14, (Oct. 1997).
Waldvogel et al., “Scalable High Speed IP Routing Lookups,” Proceedings ACM SIGCOMM, p. 25-36, (Oct. 1997).
Gray, “Internet Growth Summary,” http://www.mit.edu/people/mkgray
et/internet-growth-summary.html, p. 1-2, (1996).
Sklower, “A Tree-Based Packet Routing Table for Berkeley Unix,” Technical Report, EECS Department, Computer Science Division, p. 1-14, (1990).

Affiliated with

Also associated with

Rating

Methods and systems for fast binary network 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 Methods and systems for fast binary network address lookups..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and systems for fast binary network address lookups... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3463328