Rapid alternate paths for network destinations

Details Rapid alternate paths for network destinations Rapid alternate paths for network destinations

2004-11-19

2010-11-09

Sefcheck, Gregory B (Department: 2477)

Multiplex communications

Fault recovery

Bypass an inoperative switch or inoperative element of a...

Reexamination Certificate

active

07830786

ABSTRACT:
Network traffic is sent via alternate paths in cases of network link or node failure. An alternate node responds to U-Turn traffic from a primary neighbor to select a further alternate. An algorithm for determining the alternate paths is provided to select loop-free neighbors.

REFERENCES:
patent: 5253248 (1993-10-01), Dravida et al.
patent: 5265092 (1993-11-01), Soloway et al.
patent: 5754543 (1998-05-01), Seid
patent: 5881243 (1999-03-01), Zaumen et al.
patent: 5923646 (1999-07-01), Mandhyan
patent: 6098107 (2000-08-01), Narvaez-Guarnieri et al.
patent: 6385649 (2002-05-01), Draves et al.
patent: 6564145 (2003-05-01), Kim et al.
patent: 6785277 (2004-08-01), Sundling et al.
patent: 6928484 (2005-08-01), Huai et al.
patent: 7035227 (2006-04-01), Garcia-Luna-Aceves et al.
patent: 7093027 (2006-08-01), Shabtay et al.
patent: 7099286 (2006-08-01), Swallow
patent: 7126921 (2006-10-01), Mark et al.
patent: 7127523 (2006-10-01), Kotser
patent: 7188280 (2007-03-01), Shinomiya et al.
patent: 7295510 (2007-11-01), Johri
patent: 7362709 (2008-04-01), Hui et al.
patent: 7385917 (2008-06-01), Mo et al.
patent: 7430164 (2008-09-01), Bare
patent: 7500013 (2009-03-01), Dziong et al.
patent: 2002/0110119 (2002-08-01), Fredette et al.
patent: 2002/0131424 (2002-09-01), Suemura
patent: 2002/0176363 (2002-11-01), Durinovic-Johri et al.
patent: 2002/0186665 (2002-12-01), Chaffee et al.
patent: 2003/0043798 (2003-03-01), Pugel
patent: 2003/0091043 (2003-05-01), Mehrotra et al.
patent: 2003/0095500 (2003-05-01), Cao
patent: 2003/0193898 (2003-10-01), Wong et al.
patent: 2003/0193959 (2003-10-01), Lui et al.
patent: 2004/0042402 (2004-03-01), Galand et al.
patent: 2004/0052207 (2004-03-01), Charny et al.
patent: 2004/0114513 (2004-06-01), Badt, Jr.
patent: 2005/0088965 (2005-04-01), Atlas et al.
patent: 2006/0067330 (2006-03-01), Schollmeier et al.
patent: 1 111 860 (2001-06-01), None
patent: WO 00/59240 (2000-10-01), None
patent: WO 01/06807 (2001-01-01), None
patent: WO 02/23832 (2002-03-01), None
Cormen, Thomas H., et al.,Introduction to Algorithms, 25.2 Dijkstra's Algorithm, The MIT Press, Cambridge, Massachusetts, pp. 527-531 (1990).
Kini, Sriganesh, et al., “Traffic Restoration in Link State Protocols Using Neighbor's Shortest Path,” Internet Draft, www.watersprings.org/pub/id/draft-kini-traf-restore-nsp-00.txt, 8 pgs., (2002).
Demetrescu, Camil, et al., “Oracles for Distances Avoiding a Link-failure,” http://citeseer.ist.psu.edu/demetrescu02oracles.html, pp. 1-10 (2002).
Thorup, Mikkel, “Fortifying OSPF/IS-IS Against Link-Failure,” AT&T Labs-Research, pp. 1-10 (2001).
Alaettinoglu, Cengiz, et al., “IGP Fast Reroute,” http://www.packetdesign.com/publications, IETF Routing Area, Atlanta, pp. 1-14 (2002).
Katz, Dave, “Why Are We Scared of SPF? IGP Scaling and Stability,” Juniper Networks, Inc., http://www.nanog.org/mtg-0206/ppt/katz/sld001.htm, pp. 1-22 (2002).
Filsfils, Clarence, et al., “Engineering a Multiservice IP Backbone to Support Tight SLAs,”Computer Networks, Jun. 2002 NANOG25 Meeting, http://www.nanog.org/mtg-0206/filsfils.html, pp. 1-15 (2002).
Narváez, Paolo, et al., “Fault-Tolerant Routing in the Internet without Flooding,”Proceedings of the 1999 IEEE Workshop on Fault-Tolerant Parallel and Distributed Systems, San Juan, Puerto Rico, Apr. 1999, pp. 1-13, http://perth.mit.edu/˜pnarvaez/publications.html.
Narváez, Paolo, et al., “Local Restoration Algorithm for Link-State Routing Protocols,”Proceedings of the 1999 IEEE International Conference on Computer Communications and Networks, Boston, Massachusetts, Oct. 1999, 6 pgs., http://perth.mit.edu/˜pnarvaez/publications.html.
Narváez, Paolo, et al., “Efficient Algorithms for Multi-Path Link-State Routing,”Proceedings of the 1999 International Symposium on Communications, Kaohsiung, Taiwan, Nov. 1999, 5 pgs., http://perth.mit.edu/˜pnarvaez/publications.html.
Anderson, L., et al., “LDP Specification,” RFC 3036, [online] Jan. 2001 [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://www.ietf.org/rfc/rfc3036.txt.
Awduche, D., et al., “RSVP-TE: Extensions to RSVP for LSP Tunnels,” RFC 3209, [online] Dec. 2001 [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://www.ietf.org/rfc/rfc3209.txt.
Retana, A., et al., “OSPF Stub Router Advertisement,” RFC 3137, [online] Jun. 2001 [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://tools.ietf.org/html/rfc3137.
McPherson, D, “Intermediate System to Intermediate System (IS-IS) Transient Blackhole Advoidance,” RFC 3277, [online] Apr. 2002 [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://www.ietf.org/rfc/rfc3277.txt.
Callon, R., “Use of OSI IS-IS for Routing in TCP/IP and Dual Environments,” RFC 1195, [online] Dec. 1990. [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://www.ietf.org/rfc/rfc1195.txt.
Li, T., et al., “Domain-wide Prefix Distribution with Two-Level IS-IS,” RFC 2966, [oneline] Oct. 2000 [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://www.ietf.org/rfc/rfc2966.txt.
Coltun, R., “The OSPF Opaque LSA Option,” RFC 2370, [online] Jul. 2008. [retrieved on Apr. 1, 2009]. Retrieved from the Internet URL:http://www.ietf.org/rfc/rfc2370.txt.

Affiliated with

Also associated with

Rating

Rapid alternate paths for network destinations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Rapid alternate paths for network destinations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rapid alternate paths for network destinations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4247014