Classless interdomain routing using binary content...

Details Classless interdomain routing using binary content... Classless interdomain routing using binary content...

2005-06-21

2005-06-21

Kim, Hong (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Specific memory composition

C711S128000, C365S049130

Reexamination Certificate

active

06910097

ABSTRACT:
A method and apparatus for using a binary CAM array to implement Classless Interdomain Routing (CIDR) address processing. A binary CAM array is segmented into a plurality of array groups, each of which includes a number of rows of binary CAM cells and an associated group global mask. Each array group may be assigned to a particular prefix length by storing a prefix mask pattern corresponding to the prefix length in the array group's associated group global mask. CIDR address entries are then stored in array groups assigned to corresponding CIDR prefixes so that an array group assigned to a particular prefix stores only CIDR addresses having that prefix.

REFERENCES:
patent: 3949368 (1976-04-01), West
patent: 4622653 (1986-11-01), McElroy
patent: 4670858 (1987-06-01), Almy
patent: 4813002 (1989-03-01), Joyce et al.
patent: 4928260 (1990-05-01), Chuang et al.
patent: 4958377 (1990-09-01), Takahashi
patent: 4996666 (1991-02-01), Duluk, Jr.
patent: 5319589 (1994-06-01), Yamagata et al.
patent: 5351208 (1994-09-01), Jiang
patent: 5386413 (1995-01-01), McAuley et al.
patent: 5440715 (1995-08-01), Wyland
patent: 5485418 (1996-01-01), Hiraki et al.
patent: 5515370 (1996-05-01), Rau
patent: 5642322 (1997-06-01), Yoneda
patent: 5818786 (1998-10-01), Yoneda
patent: 5870324 (1999-02-01), Helwig et al.
patent: 5920886 (1999-07-01), Feldmeier
patent: 5999435 (1999-12-01), Henderson et al.
patent: 6000008 (1999-12-01), Simcoe
patent: 6006306 (1999-12-01), Haywood et al.
patent: 6009504 (1999-12-01), Krick
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6081440 (2000-06-01), Washburn et al.
patent: 6098147 (2000-08-01), Mizuhara
patent: 6134135 (2000-10-01), Andersson
patent: 6137707 (2000-10-01), Srinivasan et al.
patent: 6144574 (2000-11-01), Kobayashi et al.
patent: 6154384 (2000-11-01), Nataraj et al.
patent: 6161144 (2000-12-01), Michels et al.
patent: 6181698 (2001-01-01), Hariguchi
patent: 6195701 (2001-02-01), Kaiserswerth et al.
patent: 6199140 (2001-03-01), Srinivasan et al.
patent: 6237061 (2001-05-01), Srinivasan et al.
patent: 6266262 (2001-07-01), Washburn et al.
patent: 6289414 (2001-09-01), Feldmeier et al.
patent: 6362992 (2002-03-01), Cheng
patent: 6370613 (2002-04-01), Diede et al.
patent: 6389506 (2002-05-01), Ross et al.
patent: 6499081 (2002-12-01), Nataraj et al.
patent: 6502163 (2002-12-01), Ramankutty
patent: 6526474 (2003-02-01), Ross
patent: 6597690 (2003-07-01), Mehta et al.
patent: 1063827 (2000-12-01), None
patent: 11-102589 (1999-04-01), None
patent: WO 01/11630 (2001-02-01), None
Kobayashi et al, “A 50-Mpps Longest Prefix Match Search Engine LSI for Multi-gigabit IP Forwarding,” Techincal Report of IEICE, Nov. 1998, pp. 7-12.
Gupta et al, “Routing Lookups in Hardware at Memory Access Speeds,”Proc. Infocom San Francisco, Apr. 1998.
Robinson, “Pattern Addressable Memory,” IEEE Micro, Jun. 1992, pp. 20-30.
Huang et al, “A Fast IP Routing Lookup Scheme for Gigabit Switching Routers,”IEEE 1999, pp. 1429-1436.
Huang, “A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers,” IEEE Journal on Selected Areas in Communications, Jun. 1999, pp. 1093-1104.
Hayashi et al, “High Speed Table Lookup Engine for IPv6 Longest Prefix Match,”IEEE Global Telecommunications Conference, 1999, pp. 1576-1581.
Kobayashi et al, “A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing,”IEEE, 2000; pp. 1360-1364.
Kobayashi et al, “A Processor Based High-Speed Longest Prefix Match Search Engine,”IEEE, 2000, pp. 233-239.
Waldvogel et al, “Scalable High Speed IP Routing Lookups,” SIGCOMM 1997, Cannes, France, pp. 25-35.
Waldvogel et al, “Scalable High-Speed Prefix Matching,” ACM Transactions on Computer Systems, Nov. 2001, pp. 440-482.
Srinivasan et al, “Fast Address Lookups Using Controlled Prefix Expansion,” ACM Transactions of Computer Systems, Feb. 1999, pp. 1-10.

Affiliated with

Also associated with

Rating

Classless interdomain routing using binary content... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Classless interdomain routing using binary content..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Classless interdomain routing using binary content... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3511961