Technique for prefix limit exchange for route advertisement

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Routing data updating

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S220000, C709S228000, C709S230000

Reexamination Certificate

active

07418519

ABSTRACT:
A technique for prefix limit exchange for route advertisement is disclosed. In one particular exemplary embodiment, the technique may be realized as a method for prefix limit exchange for route advertisement. The method comprises communicating a prefix limit from a first element to a second element, wherein the first element and the second element are routing neighbors in a network. The method also comprises advertising a plurality of routes from the second element to the first element. The method further comprises recording, at the second element, a number of the plurality of routes that the second element has advertised to the first element. The method additionally comprises suspending route advertisement from the second element to the first element when the number is the same as or greater than the prefix limit.

REFERENCES:
patent: 6385170 (2002-05-01), Chiu et al.
patent: 6483833 (2002-11-01), Jagannath et al.
patent: 6718396 (2004-04-01), Maejima et al.
patent: 6728782 (2004-04-01), D'Souza et al.
patent: 6768739 (2004-07-01), Kobayashi et al.
patent: 6868388 (2005-03-01), Millsap et al.
patent: 6965937 (2005-11-01), Gaddis et al.
patent: 7039687 (2006-05-01), Jamieson et al.
patent: 7136374 (2006-11-01), Kompella
patent: 7369556 (2008-05-01), Rekhter et al.
patent: 2002/0069278 (2002-06-01), Forslow
patent: 2002/0069292 (2002-06-01), Gaddis et al.
patent: 2002/0078223 (2002-06-01), Baldonado et al.
patent: 2003/0021232 (2003-01-01), Duplaix et al.
patent: 2003/0103456 (2003-06-01), Hodgkinson
patent: 2003/0140167 (2003-07-01), Harvey et al.
patent: 2003/0174717 (2003-09-01), Zabarski et al.
patent: 2003/0231587 (2003-12-01), Sankaran et al.
patent: 2004/0081154 (2004-04-01), Kouvelas
patent: 2004/0085961 (2004-05-01), Coffell et al.
patent: 2004/0111529 (2004-06-01), Parmar
patent: 2004/0193619 (2004-09-01), Venkatachary et al.
patent: 2004/0249803 (2004-12-01), Vankatachary et al.
patent: 2005/0047353 (2005-03-01), Hares
patent: 2006/0198322 (2006-09-01), Hares
patent: 2006/0221971 (2006-10-01), Andrieux et al.
“BGP Restart Session After Max-Prefix Limit”, Cisco Systems, http://www.cisco.com/univercd/cc/td/doc/product/software/ios122/122newft/122t/122t15/ftbrsamp.htm; Aug. 21, 2003.
Rekhter, Y., and T. Li, “A Border Gateway Protocol 4 (BGP-4)”, RFC 1771, Mar. 1995 ftp://ftp.rfc-editor.org/in-notes/rfc1771.txt.
Chandra, R., Scudder, J., “Capabilities Advertisement with BGP-4”, rfc 2842, May 2000 ftp://ftp.rfc-editor.org/in-notes/rfc2842.txt.
Chen, E., “Route Refresh Capability for BGP-4”, RFC 2918, Sep. 2000 ftp://ftp.rfc-editor.org/in-notes/rfc2918.txt.
Patel, K., Hares, S. “Aspath Based Outbound Route Filter for BGP-4”, Internet Draft http://www.ietf.org/internet-drafts/draft-ietf-idr-aspath-orf-05.txt.
Chen, E., Rekhter, Y., “Cooperative Route Filtering Capability for BGP-4”, Internet Draft http://www.ietf.org/internet-drafts/draft-ietf-idr-route-filter-09.txt.
Chen, E., Sangli, S. R., “Dynamic Capability for BGP-4”, Internet Draft http://www.ietf.org/internet-drafts/draft-ietf-idr-dynamic-cap-04.txt.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Technique for prefix limit exchange for route advertisement does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Technique for prefix limit exchange for route advertisement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for prefix limit exchange for route advertisement will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4012361

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.