System and method for distributing route selection in an...

Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C307S402000

Reexamination Certificate

active

07023808

ABSTRACT:
A partial best path technique distributes route selection in a routing protocol implementation on a router. The technique also ensures that announced paths received from peers of the router (i.e., a “load”) are compared in a correct order to select best paths that are then used by the router to forward packets and to advertise to the peers. When employed in a distributed architecture, the technique further reduces memory usage. To that end, the partial best path technique enhances a best path selection algorithm executed by the router to enable dispersion of the received path load among processing nodes or elements of the router, while maintaining the ordering requirement of the algorithm. The partial best path technique essentially provides an enhancement to the best path selection algorithm that selects a subset of paths from a plurality of paths, with that subset being the minimal subset needed to select the best paths.

REFERENCES:
patent: 5088032 (1992-02-01), Bosack
patent: 5519704 (1996-05-01), Farinacci et al.
patent: 5617421 (1997-04-01), Chin et al.
patent: 5881243 (1999-03-01), Zaumen et al.
patent: 6370119 (2002-04-01), Basso et al.
patent: 6400681 (2002-06-01), Bertin et al.
patent: 6584093 (2003-06-01), Salama et al.
patent: 2005/0074001 (2005-04-01), Mattes et al.
patent: 2005/0074003 (2005-04-01), Ball et al.
Radia Perlman, Interconnections, Bridges and Routers, Addison Wesley Publishing Company, pp. 323-329, 1992.
Y. Rekhter et al., “A Border Gateway Protocol 4 (BGP-4)” Request For Comments (RFC) 1771, Internet Engineering Task Force, http://www.ietf.org, Mar. 1995, pp. 1-57.
Y. Rekhter et al., <draft-ietf-idr-bgp4-23.txt> “A Border Gateway Protocol 4 (BGP-4)”, Internet Engineering Task Force, http://www.ietf.org, Nov. 2003, pp 1-98.
T. Bates et al., “Multiprotocol Extensions for BGP-4” Request for Comments (RFC) 2858, Internet Engineering Task Force, http://www.ietf.org/, Jun. 2000 pp 1-11.
R. Chandra et al., “Capabilities Advertisement with BGP-4” RFC 3392, Internet Enginerring Tast Force, http://www.ietf.org/, Nov. 2002, pp 1-6.
G. Nalawade et al., <draft-nalawade-bgp-soft-notify-00.txt> “BGPv4 Soft-Notification Message”, Internet Engineering Task Force, http://www.ietf.org/, Oct. 2003, pp 1-9.
Reynolds et al., “Assigned Numbers” Request for Comments (RFC) 1700, Internet Engineering Task Force, http://www.ietf.org/, Oct. 1994, pp 1-215.
“Address Family Numbers”, http://www.iana.org/, last updated May 14, 2002.
“SAFI-Subsequence Address Family Identifier per [RFC2858]”, http://www.iana.org/, last updated Feb. 12, 2004.
Tanenbaum, Andrew S., “Computer Networks” Third Edition; Chapter 1, Section 1.4.2, “The TCP/IP Reference Model”; Prentice Hall PTR, 1996, New Jersey, pp. 35-38.
“Notification of Transmittal of The International Search Report and the Written Opinion of the International Searching Authority, or the Declaration”, International Application No. PCT/US04/42667 with an International Filing Date of Dec. 17, 2004.
“Written Opinion of the International Searching Authority” International Application No. PCT/US04/42667 with an International Filing Date of Dec. 17, 2004.

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

System and method for distributing route selection in an... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for distributing route selection in an..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for distributing route selection in an... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3545486

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