Efficient constrained shortest path first optimization...

Details Efficient constrained shortest path first optimization... Efficient constrained shortest path first optimization...

2011-08-09

2011-08-09

Shah, Chirag G (Department: 2477)

Multiplex communications

Fault recovery

C370S254000, C370S401000

Reexamination Certificate

active

07995461

ABSTRACT:
A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.

REFERENCES:
patent: 5606669 (1997-02-01), Bertin et al.
patent: 6262984 (2001-07-01), Rochberger
patent: 6304576 (2001-10-01), Corley et al.
patent: 6363319 (2002-03-01), Hsu
patent: 6370119 (2002-04-01), Basso et al.
patent: 6400681 (2002-06-01), Bertin et al.
patent: 6563798 (2003-05-01), Cheng
patent: 6600724 (2003-07-01), Cheng
patent: 6717920 (2004-04-01), Cheng
patent: 6721269 (2004-04-01), Cao et al.
patent: 6765880 (2004-07-01), Hillard et al.
patent: 6795425 (2004-09-01), Raith
patent: 6801496 (2004-10-01), Saleh et al.
patent: 6850486 (2005-02-01), Saleh et al.
patent: 6856627 (2005-02-01), Saleh et al.
patent: 6898183 (2005-05-01), Garakani
patent: 6934249 (2005-08-01), Bertin et al.
patent: 6956821 (2005-10-01), Szviatovszki et al.
patent: 7301911 (2007-11-01), Mack-Crane et al.
patent: 7319700 (2008-01-01), Kompella
patent: 2001/0033570 (2001-10-01), Makam et al.
patent: 2003/0126287 (2003-07-01), Charny et al.
patent: 2004/0151181 (2004-08-01), Chu et al.
patent: 2005/0083936 (2005-04-01), Ma
patent: 2006/0039391 (2006-02-01), Vasseur et al.
Rekhter, Y., RFC 1771, entitled A Border Gateway Protocol 4 (BGP-4), Mar. 1995, pp. 1-54.
Callon, R., RFC 1195, entitled Use of OSI ISIS for routing in TCP/IP and Dual Environments, Dec. 1990, pp. 1-80.
Moy, J., RFC 2328, entitled OSPF Version 2, Apr. 1998, pp. 1-183.
Awduche, D. et al., RFC 3209, entitled RSVP-TE: Extensions to RSVP for LSP Tunnels Dec. 2001, pp. 1-43.
Smit, H., RFC 3784, entitled Intermediate-System-to-Intermediate-System (IS-IS) Extensions for Traffic Engineering (TE), Jun. 2004, pp. 1-13.
Katz, D. et al., RFC 3630, entitled Traffic Engineering (TE) Extensions to OSPF Version 2, Sep. 2003, pp. 1-14.
Braden, R. et al., RFC 2205, entitled Resource ReSerVation Protocol (RSVP), Version 1 Functional Specification, Sep. 1997, pp. 1-112.
Berger, L., RFC 3473, entitled Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Extensions, Jan. 2003, pp. 1-40.
Mannie, E., RFC 3945, entitled Generalized Multi-Protocol Label Switching (GMPLS) Architecture, Oct. 2004, pp. 1-65.
Mannie, E., RFC 3946, entitled Generalized Multi-Protocol Label Switching (GMPLS) Extensions for Synchronous Optical Network (SONET) and Synchronous Digital Hierarchy (SDH) Control, Oct. 2004, pp. 1-25.
Perlman, Radia, Interconnections Second Edition: Bridges, Routers, Switches, and Internetworking Protocols, Addison Wesley, 1999, Section 12.2.4, pp. 317-319.
Vasseur, J. P., et al., Network Working Group Internet Draft, entitled RSVP Path Computation Request and Reply Messages (draft-vasseur-mpls-computation-rsvp-05.txt), Jul. 2004, pp. 1-31.
Vasseur, J. P., et al., IETF Internet Draft, entitled Path Computation Element (PCE) Communication Protocol, (PCE))—Version 1, (draft-vasseur-pce-pcep-01.txt, pp. 1-43.

Affiliated with

Also associated with

Rating

Efficient constrained shortest path first optimization... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient constrained shortest path first optimization..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient constrained shortest path first optimization... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2658571