System and method for retrieving computed paths from a path computation element using a path key

Abstract

A technique retrieves computed path segments across one or more domains of a computer network in accordance with a stateful (“semi-stateful”) path computation element (PCE) model. The stateful PCE model includes a data structure configured to store one or more path segments computed by a PCE in response to a path computation request issued by a Path Computation Client (PCC). Notably, each computed path segment stored in the data structure is identified by an associated path-key value (“path key”). The path segment and path key contents of the data structure are temporarily saved (“cached”) at a predetermined location in the network for a configurable period of time.

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to computer networks and more particularly to retrieving paths computed by path computation elements of a computer network.

2. Background Information

A computer network is a geographically distributed collection of nodes interconnected by communication links and segments for transporting data between end nodes, such as personal computers and workstations. Many types of networks are available, with the types ranging from local area networks (LANs) to wide area networks (WANs). LANs typically connect the nodes over dedicated private communications links located in the same general physical location, such as a building or campus. WANs, on the other hand, typically connect geographically dispersed nodes over long-distance communications links, such as common carrier telephone lines, optical lightpaths, synchronous optical networks (SONET), or synchronous digital hierarchy (SDH) links. The Internet is an example of a WAN that connects disparate networks throughout the world, providing global communication between nodes on various networks. The nodes typically communicate over the network by exchanging discrete frames or packets of data according to predefined protocols, such as the Transmission Control Protocol/Internet Protocol (TCP/IP). In this context, a protocol consists of a set of rules defining how the nodes interact with each other.

Computer networks may be further interconnected by an intermediate node, such as a router, to extend the effective “size” of each network. Since management of a large system of interconnected computer networks can prove burdensome, smaller groups of computer networks may be maintained as routing domains or autonomous systems. The networks within an autonomous system (AS) are typically coupled together by conventional “intradomain” routers configured to execute intradomain routing protocols, and are generally subject to a common authority. To improve routing scalability, a service provider (e.g., an ISP) may divide an AS into multiple “areas.” It may be desirable, however, to increase the number of nodes capable of exchanging data; in this case, interdomain routers executing interdomain routing protocols are used to interconnect nodes of the various ASes. It may also be desirable to interconnect various ASes that are operated under different administrative domains. As used herein, a router that connects different areas or ASes together is generally referred to as a border router. In the case of areas rather than ASes since the routers are under a common authority, a single router may in fact serve as an exit border router of one area and an entry border router of another area.

An example of an interdomain routing protocol is the Border Gateway Protocol version 4 (BGP), which performs routing between ASes by exchanging routing and reachability information among neighboring interdomain routers of the systems. An adjacency is a relationship formed between selected neighboring (peer) routers for the purpose of exchanging routing information messages and abstracting the network topology. BGP generally operates over a reliable transport protocol, such as the Transmission Control Protocol (TCP), to establish a TCP connection/session. The BGP protocol is well known and generally described in Request for Comments (RFC) 1771, entitled A Border Gateway Protocol 4 (BGP-4), published March 1995, which is hereby incorporated by reference.

Examples of an intradomain routing protocol, or an interior gateway protocol (IGP), are the Open Shortest Path First (OSPF) routing protocol and the Intermediate-System-to-Intermediate-System (ISIS) routing protocol. The OSPF and ISIS protocols are based on link-state technology and, therefore, are commonly referred to as link-state routing protocols. Link-state protocols define the manner with which routing information and network-topology information are exchanged and processed in an AS or area. This information is generally directed to an intradomain router's local state (e.g., the router's usable interfaces and reachable neighbors or adjacencies). The OSPF protocol is described in RFC 2328, entitled OSPF Version 2, dated April 1998 and the ISIS protocol is described in RFC 1195, entitled Use of OSI ISIS for routing in TCP/IP and Dual Environments, dated December 1990, both of which are hereby incorporated by reference.

Multi-Protocol Label Switching (MPLS) Traffic Engineering has been developed to meet data networking requirements such as guaranteed available bandwidth or fast restoration. MPLS Traffic Engineering exploits modern label switching techniques to build guaranteed bandwidth end-to-end tunnels through an IP/MPLS network of label switched routers (LSRs). These tunnels are a type of label switched path (LSP) and thus are generally referred to as MPLS Traffic Engineering (TE) LSPs. Examples of MPLS TE can be found in RFC 3209, entitled RSVP-TE: Extensions to RSVP for LSP Tunnels dated December 2001, RFC 3784 entitled Intermediate-System-to-Intermediate-System (IS-IS) Extensions for Traffic Engineering (TE) dated June 2004, and RFC 3630, entitled Traffic Engineering (TE) Extensions to OSPF Version 2 dated September 2003, the contents of all of which are hereby incorporated by reference in their entirety.

Establishment of an MPLS TE LSP from a head-end LSR to a tail-end LSR involves computation of a path through a network of LSRs. Optimally, the computed path is the “shortest” path, as measured in some metric, that satisfies all relevant LSP Traffic Engineering constraints such as e.g., required bandwidth, availability of backup bypass tunnels for each link and node included in the path, etc. Path computation can either be performed by the head-end LSR or by some other entity operating as a path computation element (PCE). The head-end LSR (or a PCE) exploits its knowledge of network topology and resources available on each link to perform the path computation according to the LSP Traffic Engineering constraints. Various path computation methodologies are available including CSPF (constrained shortest path first). MPLS TE LSPs can be configured within a single IGP area or may also span multiple IGP areas or ASes.

The PCE is an entity having the capability to compute paths between any nodes of which the PCE is aware in an AS or area. PCEs are especially useful in that they are more cognizant of network traffic and path selection within their AS or area, and thus may be used for more optimal path computation. A head-end LSR may further operate as a path computation client (PCC) configured to send a path computation request to the PCE, and receive a response with the computed path, potentially taking into consideration other requests from other PCCs. It is important to note that when one PCE sends a request to another PCE, it acts as a PCC. PCEs conventionally have limited or no visibility outside of its surrounding area or AS. A PCC can be informed of a PCE either by preconfiguration by an administrator, or by a PCE Discovery (PCED) message (“advertisement”), which is sent from the PCE within its area or across the entire AS to advertise its services.

One difficulty that arises in crossing AS boundaries is that path computation at the head-end LSR requires knowledge of network topology and resources across the entire network between the head-end and the tail-end LSRs. Yet service providers typically do not share this information with each other across AS borders. Neither the head-end LSR nor any single PCE will have sufficient knowledge to compute a path. Because of this, MPLS Traffic Engineering path computation techniques are required to compute inter-domain TE LSPs. A similar problem arises in computing the paths of MPLS Traffic Engineering LSPs across areas. Network topology and resource information do not generally flow across area boundaries even though a single service provider may operate all the areas.

The use of PCEs has been adapted to create a distributed PCE architecture, in order to extend MPLS TE LSPs across AS or area boundaries. An example of such a distributed architecture is described in commonly-owned copending U.S. patent application Ser. No. 10/767,574, entitled COMPUTING INTER-AUTONOMOUS SYSTEM MPLS TRAFFIC ENGINEERING LSP PATHS, filed by Vasseur et al., on Sep. 18, 2003, the contents of which are hereby incorporated by reference in its entirety. In a distributed PCE architecture, the visibility needed to compute paths is extended between adjacent areas and ASes so that PCEs may cooperate to compute paths across multiple areas or ASes by exchanging virtual shortest path trees (VSPTs) while preserving confidentiality across ASes. VSPTs, which may be represented as virtual links made of “loose hops,” are used because service providers may desire to maintain their internal network architectures and designs confidential. One way to compute the VSPTs is by using a virtual shortest path tree (VSPT) algorithm. Generally, a VSPT is a compressed path description (entry and exit/destination points of areas/ASes) that informs a previous PCE that a destination can be reached from a particular entry to a particular exit in such a way that the internal path specifics are kept confidential from an adjacent area or AS. The virtual links that compose the VSPT will generally have an associated network cost for each calculated link. It should be noted that in the context of multiple ASes operating under a common authority (e.g. a unique service provider), such virtual links may also specify an entire path. A set of virtual links may be further organized (in certain protocols) within an explicit route object (ERO) to facilitate transfer of the compressed path descriptions to the previous PCE.

Some applications may incorporate unidirectional data flows configured to transfer time-sensitive traffic from a source (sender) in a computer network to a destination (receiver) in the network in accordance with a certain “quality of service” (QoS). Here, network resources may be reserved for the unidirectional flow to ensure that the QoS associated with the data flow is maintained. The Resource Reservation Protocol (RSVP) is a network-control protocol that enables applications to reserve resources in order to obtain special QoS for their data flows. RSVP works in conjunction with routing protocols to, e.g., reserve resources for a data flow in a computer network in order to establish a level of QoS required by the data flow. RSVP is defined in R. Braden, et al., Resource ReSerVation Protocol (RSVP), RFC 2205. In the case of traffic engineering applications, RSVP signaling is used to convey various TE LSP attributes, e.g., an ERO, to routers, such as border routers, along the TE LSP obeying the set of required constraints.

Because an inter-area or inter-AS TE LSP may have been computed by means of a cooperative set of PCEs, the computed path may be known by the head-end LSR as a set of loose hops. Consequently, such paths would be signaled by the head-end LSR using an ERO made of loose hops. However, when using loose hops in the ERO, the computed path from a PCE within an area or AS may or may not be the actual path used because the traversed loose hop may not have the knowledge of this computed path and thus may compute a different path than the path previously computed by the PCE. Indeed, because a loose hop only signifies the entry and exit of an area or AS, a border router (the entry) receiving the loose hop must generally recompute a path segment to the exit in accordance with conventional ERO expansion techniques and using its own knowledge of the network. Even in the case where the entry is the PCE that originally computed the path, PCE is generally stateless, meaning once it computes the path segment and sends the response to a PCC, the path is no longer stored in memory, so it, too, must recompute the path. Such re-computation consumes resources of the border router, and may in some cases not provide the promised path cost (e.g., when the border router computes a different path segment to reach the exit). In addition, re-computation of paths introduces delays or latencies that may adversely impact time sensitive traffic engineering applications, such as TE LSP set up times.

Diverse paths between nodes, e.g., a source and destination, in the network offer a variety of benefits including redundancy, in the case of a node or link failure (because a single failure may not simultaneously impact diverse paths), and load balancing of traffic while trying to limit the impact of a failure on some part of the traffic. Therefore, a PCE may often be requested to compute diverse paths; however, in response to such a request, there is no guarantee that the re-computed paths will remain diverse. For example, if two entry border routers of an area receive a path reservation request with loose hops to exits, independently they will be unaware of each other, and unaware of the diversity requirement. Because of this, when recomputing the path segments, both border routers may utilize the same internal network devices along the way to the different exit border routers of the loose hops, thereby losing the requested diversity.

There remains a need, therefore, for a system and method to retrieve specific internal-area or internal-AS paths that have been computed by a PCE.

SUMMARY OF THE INVENTION

The present invention is directed to a technique for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful (or “semi-stateful”) path computation element (PCE) model. The stateful PCE model includes a data structure configured to store one or more path segments computed by a PCE in response to a path computation request issued by a Path Computation Client (PCC). Notably, each computed path segment stored in the data structure is identified by an associated path-key value (“path key”). The path segment and path key contents of the data structure are temporarily saved (“cached”) at a predetermined location in the network for a configurable period of time.

In the illustrative embodiment, the data structure is embodied as a computed path segment table stored at one or more PCEs within the domains of the network. The path segment table includes a plurality of entries, each of which contains a computed path segment field and associated path-key field. In response to the path computation request, the PCE computes the path segment and generates the path key. The computed segment and generated key are then cached in the computed path segment and path-key fields, respectively, of an entry in the table. Thereafter, the PCE returns a path computation response, including the path key and the computed path containing compressed path descriptions of the computed path segment, to the PCC.

Upon receiving the response, the PCC generates a path reservation message for transmission to certain receiving nodes, such as border routers, along the path described by the ERO. The path reservation message is illustratively a Resource ReSerVation Protocol (RSVP) path message that includes a novel path key object containing one or more key identifier (ID) sub-objects. According to an aspect of the invention, each key ID sub-object contains an ID of the PCE (“identified PCE”) caching a computed path segment of the ERO and its associated path key.

The receiving border router scans the path reservation message searching for the path key object. In response to locating that object, the router extracts the PCE ID and path key, and generates a path computation request containing this extracted information for transmission to the identified PCE. The identified PCE receives the request and indexes into the path segment table by, e.g., matching the content of the path-key field with the extracted key. The computed path segment stored in a matching entry is then returned to the router via a path computation reply.

Advantageously, the technique described herein enables efficient computation of paths, such as inter-domain traffic engineering (TE) label switched paths (LSPs) and/or diverse paths, across multiple domains of a network. In particular, the inventive technique obviates the need to perform one or more additional path computations specified by compressed path descriptions of an ERO with respect to intra-domain segments previously computed by one or more PCEs. The invention further provides an optimal set of (shortest) path segments, while preserving confidentiality across the multiple domains, and allows for the preservation of computed path diversity.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and further advantages of invention may be better understood by referring to the following description in conjunction with the accompanying drawings in which like reference numerals indicate identical or functionally similar elements:

FIG. 1A is a schematic block diagram of an exemplary computer network of autonomous systems that may be used in accordance with the present invention;

FIG. 1B is a schematic block diagram of an exemplary computer network of areas that may be used in accordance with the present invention;

FIG. 2 is schematic block diagram of an exemplary router that may be advantageously used with the present invention;

FIG. 3 is a schematic block diagram of portions of an RSVP Path message 300 that may be advantageously used with the present invention;

FIG. 4 is a detailed schematic block diagram of the computer network of FIG. 1A that may be advantageously used with the present invention;

FIG. 5 is a schematic block diagram of a data structure which may be embodied as a computed path segment table in accordance with the present invention;

FIG. 6 is a schematic block diagram of illustrating the format of a path key object that may be advantageously used with the present invention;

FIG. 7 is a flowchart illustrating a sequence of steps for establishing a computed path for a tunnel (or tunnels) in accordance with the present invention; and

FIG. 8 is a flowchart illustrating a sequence of steps for establishing a path (tunnel) to a destination using computed paths according to the invention.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

FIG. 1A is a schematic block diagram of an exemplary computer network 100a comprising autonomous system AS2, which is interconnected with a plurality of other autonomous systems AS1, AS3, and AS4. An Autonomous System (AS) is herein defined to be a group of intermediate nodes, such as intradomain routers, within a network that are subject to a common authority and execute one or more intradomain routing protocols. Although, each AS is illustratively an autonomous system, those skilled in the art will appreciate that the ASes may alternatively be configured as routing domains or other networks or subnetworks. The autonomous system AS1 includes intradomain routers such as border routers ASBR1* and ASBR2* through which communication, such as data packets, may pass into and out of the autonomous system to border routers ASBR3 and ASBR4, respectively of AS2. AS2 also includes border routers ASBR5* and ASBR6* in communication with border routers ASBR7* and ASBR8* of ASes 3 and 4, respectively. Moreover, within AS1, AS2, AS3, and AS4, there are exemplary intradomain routers A, B, C, and D, respectively. Those skilled in the art will understand that any number of routers may be used in the ASes, and that the view shown herein is for simplicity.

Data packets may be exchanged among the autonomous systems AS1-AS4 using predefined network communication protocols such as the Transmission Control Protocol/Internet Protocol (TCP/IP), User Datagram Protocol (UDP), Asynchronous Transfer Mode (ATM) protocol, Frame Relay protocol, Internet Packet Exchange (IPX) protocol, etc. Routing information may be distributed among the routers within an AS using predetermined “interior” gateway protocols (IGPs), such as conventional distance-vector protocols or, illustratively, link-state protocols, through the use of link-state advertisements (LSAs) or link-state packets. In addition, data packets containing network routing information may be exchanged among the autonomous systems AS1-AS4 using “external” gateway protocols, such as the Border Gateway Protocol (BGP).

FIG. 1B is a schematic block diagram of an exemplary computer network 100b comprising areas A1, A2, and A3, each having at least one intradomain router, A, B, and C, respectively. In addition, A1 and A2 share border routers ABR1* and ABR2*, while A2 and A3 share ABR3* and ABR4. As used herein, area is a collection of routers that share full network topology information with each other but not necessarily with routers outside the area. The term area as used herein also encompasses the term “level” which has a similar meaning for networks that employ IS-IS as their IGP. These examples are merely representative. Furthermore, the techniques described below with reference to inter-AS path computation may be used in the context of inter-area path computation and, under certain conditions, the techniques described with reference to inter-area path computation may be used for inter-AS path computation. It will be understood by those skilled in the art that wherever autonomous systems are referred to, areas may be used also.

FIG. 2 is a schematic block diagram of an exemplary router 200 that may be advantageously used with the present invention as an intradomain router or a border router. The router comprises a plurality of network interfaces 210, a processor 220, and a memory 240 interconnected by a system bus 250. The network interfaces 210 contain the mechanical, electrical and signaling circuitry for communicating data over physical links coupled to the network 100a,b. The network interfaces may be configured to transmit and/or receive data using a variety of different communication protocols, including, inter alia, TCP/IP, UDP, ATM, synchronous optical networks (SONET), wireless protocols, Frame Relay, Ethernet, Fiber Distributed Data Interface (FDDI), etc.

The memory 240 comprises a plurality of storage locations that are addressable by the processor 220 and the network interfaces 210 for storing software programs and data structures associated with the present invention. The processor 220 may comprise necessary elements or logic adapted to execute the software programs and manipulate the data structures, such as table 500. A router operating system 242, portions of which are typically resident in memory 240 and executed by the processor, functionally organizes the router by, inter alia, invoking network operations in support of software processes and/or services, such as PCC/PCE process 245, routing services 247, and RSVP services 249 executing on the router. It will be apparent to those skilled in the art that other processor and memory means, including various computer-readable media, may be used to store and execute program instructions pertaining to the inventive technique described herein.

Routing services 247 contain computer executable instructions executed by processor 220 to perform functions provided by one or more routing protocols, such as OSPF and IS-IS. These functions may be configured to manage a forwarding information database (not shown) containing, e.g., data used to make forwarding decisions. RSVP services 249 contain computer executable instructions for implementing RSVP and processing RSVP messages in accordance with the present invention. RSVP is described in R. Braden, et al., Resource ReSerVation Protocol (RSVP), Request For Comments (RFC) 2205, September 1997, available from the IETF and which is hereby incorporated by reference as though fully set forth herein, and in RFC 3209, entitled RSVP-TE: Extensions to RSVP for LSP Tunnels, as incorporated above.

In one embodiment, the routers described herein are IP routers that implement Multi-Protocol Label Switching (MPLS) and operate as label switched routers (LSRs). In one simple MPLS scenario, at an ingress to a network, a label is assigned to each incoming packet based on its forwarding equivalence class before forwarding the packet to a next-hop router. At each router, a forwarding selection and a new substitute label are determined by using the label found in the incoming packet as a reference to a label forwarding table that includes this information. At the network egress (or one hop prior), a forwarding decision is made based on the incoming label but optionally no label is included when the packet is sent on to the next hop.

The paths taken by packets that traverse the network in this manner are referred to as label switched paths (LSPs). Establishment of an LSP requires computation of a path, signaling along the path, and modification of forwarding tables along the path. MPLS Traffic Engineering establishes LSPs that have guaranteed bandwidth under certain conditions. Illustratively, the TE LSPs may be signaled through the use of the RSVP protocol.

In accordance with RSVP, to establish a data flow between a sender and a receiver, the sender may send an RSVP path (Path) message downstream hop-by-hop along a path (e.g., a unicast route) to the receiver to identify the sender and indicate e.g., bandwidth needed to accommodate the data flow, along with other attributes of the TE LSP. The Path message may contain various information about the data flow including, e.g., traffic characteristics of the data flow. FIG. 3 is a schematic block diagram of portions of an RSVP Path message 300 that may be advantageously used with the present invention. Message 300 contains, inter alia, a common header 310, a sender template object 320, a traffic specification (Tspec) object 330 and an explicit route object (ERO) 340. It should be noted that message 300 may contain other objects including a novel Path Key object 600 (described further below).

Although the illustrative embodiment described herein is directed to MPLS, it should be noted that the present invention may advantageously apply to Generalized MPLS (GMPLS), which pertains not only to packet and cell-based networks, but also to Time Division Multiplexed (TDM) and optical networks. GMPLS is well known and described in RFC 3945, entitled Generalized Multi-Protocol Label Switching (GMPLS) Architecture, dated October 2004, and RFC 3946, entitled Generalized Multi-Protocol Label Switching (GMPLS) Extensions for Synchronous Optical Network (SONET) and Synchronous Digital Hierarchy (SDH) Control, dated October 2004, the contents of both of which are hereby incorporated by reference in their entirety.

To compute paths across multiple areas or ASes, above-referenced U.S. application Ser. No. (Cisco Seq. 7787) describes the use of a virtual shortest path tree (VSPT) algorithm in a distributed path computation element (PCE) architecture, which has been incorporated by reference herein. According to the VSPT algorithm, for an inter-AS path computation example such as in FIG. 1A, a PCC (Router A) first sends a path computation request to a known local PCE in its AS, such as ASBR1*, to compute a path to a destination (e.g., a tail-end LSR) such as Router C in AS3. As an example, border routers marked with ‘*’ in FIGS. 1A and 1B are PCE enabled border routers. The address of the local PCE may be manually configured. Alternatively, the PCE may advertise itself through flooding within the AS. Path computation element discovery (PCED) techniques can be used in accordance with OSPF MPLS Traffic Engineering Capabilities (draft-vasseur-ospf-te-caps.txt) by Vasseur, et al., published July 2004, which is hereby incorporated by reference. A PCED message may include indications of PCE capabilities, such as the ability to compute local paths, inter-area paths, inter-AS paths, multi-domain paths, diverse paths, etc.

The path computation request (and response) can be made in accordance with a protocol specified in Vasseur, et al. RSVP Path Computation Request and Reply Messages, Internet Draft, July 2004, which is hereby incorporated by reference as though fully set forth herein. The path computation request is then passed to a PCE in every AS (AS1, AS2, AS3) on the way to the destination. Knowledge of the other PCE addresses may be acquired by way of static configuration or BGP advertisements, as could be readily devised by one of skill in the art. It should be understood that the use of RSVP serves only as an example, and that other communication protocols may be used in accordance with the present invention.

Once reached by the path computation request, the PCE (ASBR7*) in the final AS (AS3) containing the destination (Router C) computes a VSPT, which is a shortest path tree rooted at the destination and includes the set of shortest path(s) satisfying a set of required constraints from this destination to every border router of the area. This may be computed using a CSPF (constrained shortest path first) algorithm as known in the art or any other suitable algorithm. The PCE of the final area then sends the VSPT to the previous AS's (AS2) PCE (ASBR5*) with a virtual link (or a “loose hop”). The VSPT optionally uses the loose hop in such a way that hops internal to an AS and their costs remain confidential. A loose hop may have a single associated cost that is a combination or representation of internal costs. If multiple equal-cost paths are found, a PCE may provide some or all of them to the requesting PCC. Other situations where a PCE may return more than one path include, e.g., where the PCC requests the computation of diverse paths. These diverse paths may or may not have equal costs.

The PCE (ASBR5*) in the previous AS now repeats the VSPT algorithm, and concatenates the VSPT it received from the final PCE (ASBR7*) with the topology of its own AS (AS2) (including the inter-AS links) to compute new paths. This process repeats through all ASes until the response reaches the originating PCC (Router A). For this reason the VSPT algorithm is referred to as a “recursive backward path computation.”

When the above described procedure completes at the originating PCC, the path in the response consists of a series of hops to the destination along the path. Notably, hops may be loose wherever the network is to be kept confidential. In this case, the complete computed path can be thought of as a basic path through the ASes that consists only of the entry and exit points of each confidential AS. The following is an example of the contents of such a computed path, also known as an ERO (such as ERO 340): “ASBR1*, ASBR3, ASBR5* (L), ASBR7*, Router C (L),” where “(L)” denotes a loose hop. The PCC can then establish a tunnel (e.g. LSP) to the destination by forwarding a RSVP Path message 300 over the computed path (in the ERO) to the exit border router of its area or AS. It should be understood that in an area architecture, the exit border router is the entry border router for the next area. This next border router then computes the specific path to the next exit border as specified by the next loose hop in the ERO 340. That exit border router thereafter repeats the procedure according to the ERO, and so on, until the destination is again reached, and a tunnel is created according to methods known in the art.

FIG. 4 is a more detailed schematic block diagram of AS1 and AS2 of network 100a, showing two diverse paths (dotted lines) between Router A and Router B that have been calculated according to the method described above. Typically, this arises when a PCC (Router A) requests a path computation that results in any number of diverse paths between it and a destination (Router B). Diverse paths are known to those skilled in the art, and offer a variety of benefits. One such benefit is redundancy of paths to a destination, so that should a node or link fail in some way, a backup path has already been established, and traffic can substantially immediately be transferred to that path. Another benefit is for load balancing the traffic that is to flow along the path. For example, a PCC with a 10 MB/sec flow of data may wish to distribute 5 MB/sec along one path, and 5 MB/sec along the other. This may limit the amount of data lost, and/or the amount of traffic to redirect, should any node or link along one of the paths fail. Other benefits of path diversity should be understood by those skilled in the art. In addition to its knowledge of the networks, a PCE can compute diverse paths because it is aware of all the paths it is computing while it computes them, so it can be sure not to use conflicting nodes or links. It is important to note that a PCC may wish to compute paths that are link diverse (share no common links), node diverse (share no common node), or Shared Risk Link Group (SRLG) diverse (share no common SRLG).

In FIG. 4, two example paths between Router A and Router B are to be established in accordance with the methods described herein. The first path begins in AS1, and will continue through nodes n1 and n2 to ASBR1*. From ASBR1*, the path travels to AS2 by continuing to ASBR3, and continues to the destination, Router B, by first passing though nodes n3, n4, and n5. A second path between Router A and Router B begins again at Router A, but has been calculated to reach a different border router, ASBR2*, through nodes m1 and m2. From ASBR2*, the path continues to AS2 through ASBR4, and then on to Router B through nodes m3 and m4. It should be noted that the dashed line from m3 to n5 to B is an example of a path possibly recomputed by ASBR4 in accordance with the methods of the prior art, given a loose hop to destination Router B. It can be seen in this case that the newly computed path is neither node diverse nor link diverse.

The present invention is directed to a technique for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful (or “semi-stateful”) PCE model. The stateful PCE model includes a data structure configured to store one or more path segments computed by a PCE in response to a path computation request issued by, e.g., a PCC. Notably, each computed path segment stored in the data structure is identified by an associated path-key value (“path key”). The path segment and path key contents of the data structure are temporarily saved (“cached”) at a predetermined location in the network for a configurable period of time.

FIG. 5 is a schematic block diagram of the data structure which, in the illustrative embodiment, is embodied as a computed path segment table 500 stored at one or more PCEs within the domains of the network. The path segment table 500 includes a plurality of entries 502, each of which contains a computed path segment field 510 and associated path-key field 505. In response to the path computation request, the PCE computes the path segment and generates the path key. The computed segment and generated key are then cached in the computed path segment and path-key fields, respectively, of an entry 502 in the table. Thereafter, the PCE returns a path computation response, including the path key and a computed path containing compressed path descriptions of the computed path segment, to the PCC.

Upon receiving the response, the PCC generates a path reservation message for transmission to certain receiving nodes, such as border routers, along the path described by the ERO. The path reservation message is illustratively a RSVP Path message 300 that includes the novel path key object 600. FIG. 6 is a schematic block diagram of illustrating the format of the path key object 600, which is illustratively embodied as a type/length/value (TLV) encoding format. The TLV object 600 is used to identify a type (T) of information being communicated (conveyed), a length (L) of information to be conveyed and a value (V) of the actual information conveyed. The length (L) parameter contained in the length field 610 is typically implementation-specific and can denote the length from the beginning of the Type field 605 of the object 600 to the end. However, the length generally denotes the length of the Value (V) field 615 and not the Type (T) or Length (L) fields.

The value field 615 illustratively contains one or more key identifier (ID) sub-objects 650. According to an aspect of the invention, each key ID sub-object 650, in turn, comprises a PCE ID field 652 containing an ID of the PCE (“identified PCE”) caching a computed path segment of the ERO. In addition, the key ID sub-object comprises a path key field containing a path key associated with the computed path segment. In the illustrative embodiment, the PCE ID is preferably the router ID of the PCE and the path key is a 32-bit unsigned number.

According to the invention, the receiving border router scans the path reservation message 300 searching for the path key object 600. In response to locating that object, the router extracts the PCE ID 652 and path key 654, and generates a path computation request containing this extracted information for transmission to the identified PCE. The identified PCE receives the request and indexes into the path segment table 500 by, e.g., matching the content of the path-key field 505 with the extracted path key 654. The computed path segment 510 stored in a matching entry 502 is then returned to the router via a path computation reply.

FIG. 7 is a flowchart illustrating a sequence of steps for establishing a computed path for a tunnel (or tunnels) in accordance with the present invention. The sequence starts at step 705, and continues to step 710, where a PCC generates a path computation request. Typically, the path computation request comprises a source PCC address and a desired tunnel destination address. Once generated, in step 715 the PCC transmits this request to a PCE to compute a path segment (“path”). In the event that there are multiple PCEs visible to the PCC, the PCC chooses the best PCE according to desired metrics. Methods of this determination are fully described in commonly-owned co-pending U.S. application Ser. No. (Atty. Docket No. 112025-0587) entitled SYSTEM AND METHOD FOR SELECTING A PATH COMPUTATION ELEMENT, filed by Vasseur et al. on even date herewith, the contents of which are hereby incorporated in its entirety.

A PCE, such as ASBR5* in FIG. 4, for example, receives the path computation request in step 720, and begins computing an optimal path or paths for the desired destination in step 725 as described above. Once the path or paths have been computed, the PCE creates a path key for the computed path in step 730. The path key and the computed path are stored (cached) in an entry of the table 500 of the PCE in step 735 for a predetermined period of time. The predetermined time may be configured by a system administrator, and may equal any set time period or be defined by a given a set of conditions, such as when the key is no longer needed (e.g. when it has been accessed, as described below). In step 740, the PCE generates a computed path containing compressed path descriptions of the computed path (as described above) and, in step 745, returns a path computation response (reply) that includes the path key and computed path, to the PCC. The PCC receives the reply in step 750 and the sequence ends at step 755. It should be noted that in an alternate embodiment of the present invention, the PCE may transmit the actual computed path segment, along with the path key, to a border router that should receive the request (e.g ASBR3 or ASBR4). The PCE would then no longer be required to cache the computed path and path key.

FIG. 8 is a flowchart illustrating a sequence of steps for establishing a path (tunnel) to a destination using computed paths according to the invention. The sequence starts at 805 and proceeds to step 810 where the PCC transmits a generated path reservation message 300 with ERO 340 and path key object 600 over the path described by the ERO (e.g., n1, n2, ASBR1*, ASBR3 . . . ) to certain receiving nodes, such as border routers. Upon receiving the message in step 815 (e.g., . . . , ASBR3, B(L), . . . ), a border router of an AS or area, such as ASBR3 in FIG. 4, calculates a path to the destination (B). In accordance with the present invention, in step 820 the border router checks for the presence of the path key object in the message. If, in step 825, it is determined that there is no path key object, the border router computes a path segment for a loose hop described on the ERO using a conventional ERO expansion technique in step 830. If, however, there is a path key object in the message, the border router then extracts both the path key and the PCE ID in step 835. In step 840, the router transmits a path computation (e.g., lookup) request with the path key to the PCE identified by the PCE ID which, according to the example, is ASBR5*. Again, in the alternate embodiment mentioned above, should the border router already have the path key and computed path segment stored locally, a local lookup would provide the border router with the computed path.

The PCE (ASBR5*) receives the request in step 845 and performs a lookup operation into the computed path segment table 500 using the path key to find an entry 502 that matches on the path key in step 750. Note that in an alternate embodiment, the path key can be used to index into the table to find the matching entry. In response to finding a matching entry, the computed path segment is retrieved (e.g., ASBR3, n3, n4, n5, B) and, in step 855, the PCE replies with the retrieved path to the requesting border router, which receives the computed path in step 860. At this point, the PCE may, but is not required to, remove the computed path segment and path key from the table 500, as mentioned above. Otherwise, the PCE may wait a predetermined time before removing the path and path key. Armed with the computed path, the border router may continue to establish the tunnel between the source router (router A) and the destination (router B) in accordance with standard tunneling procedures (step 865). The sequence then ends in step 865. Those skilled in the art should understand that the above sequence may expand when spanning even more areas or ASes.

Advantageously, the technique described herein enables efficient computation of paths, such as inter-domain traffic engineering (TE) label switched paths (LSPs) and/or diverse paths, across multiple domains of a network. In particular, the inventive technique obviates the need to perform one or more additional path computations specified by compressed path descriptions of an ERO with respect to intra-domain segments previously computed by one or more PCEs. The invention further provides an optimal set of (shortest) path segments, while preserving confidentiality across the multiple domains, and allows for the preservation of computed path diversity.

While there has been shown and described an illustrative embodiment that retrieves computed path segments across one or more domains of a computer network in accordance with a stateful (or “semi-stateful”) path computation element (PCE) model, it is to be understood that various other adaptations and modifications may be made within the spirit and scope of the present invention. For example, the invention may also be advantageously used with nested, or hierarchical areas or ASes. Illustratively, an AS may comprise multiple areas utilizing PCE-based path computation to compute Inter-AS as well as inter-area TE LSPs. In this case, upon receiving a request from a neighboring AS, the AS border router acting as a PCE may return a set of compressed paths (specifying border routers within each area) along with their associated path keys. Alternatively, the PCE may also provide a single aggregated compressed path with a single path key, which would locally translate in a succession of compressed paths with their associated keys.

The foregoing description has been directed to specific embodiments of this invention. It will be apparent, however, that other variations and modifications may be made to the described embodiments, with the attainment of some or all of their advantages. For instance, it is expressly contemplated that the teachings of this invention can be implemented as software, including a computer-readable medium having program instructions executing on a computer, hardware, firmware, or a combination thereof. Accordingly this description is to be taken only by way of example and not to otherwise limit the scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.

Claims

1. A method for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the method comprising the steps of: receiving a path computation request issued by a Path Computation Client (PCC); computing one or more path segments in response to the path computation request; associating each path segment with a path key; and storing the one or more path segments with each associated path key.

2. The method of claim 1, further comprising: saving each path segment and associated path key at a predetermined location in the network.

3. The method of claim 1, further comprising: saving each path segment and associated path key for a configured period of time.

4. The method of claim 1, further comprising: saving each path segment and associated path key in a computed path segment table.

5. The method of claim 4, further comprising: containing within the table a plurality of entries, each of which contains a computed path segment field and an associated path-key field.

6. The method of claim 1, further comprising: returning, to the PCC, a path computation response, including the path key and a computed path containing compressed path descriptions of the computed path segment.

7. The method of claim 6, further comprising: including a PCE identification with the path key, the PCE identification identifying the PCE returning the path computation response.

8. The method of claim 1, further comprising: receiving a path computation request from a border router, including a path key; extracting the path key; indexing into the stored path keys to match a particular path segment to the extracted path key; and returning the computed path segment stored in a matching entry to the border router via a path computation reply.

9. A method for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the method comprising the steps of: receiving a response to a path computation request, the response including a path key and a computed path containing compressed path descriptions of the computed path segment; generating a path reservation message, the path reservation message including the path key and an ID of a PCE caching a computed path segment of the computed path and its associated path key; and transmitting the path reservation message to certain receiving nodes along the path described by the computed path.

10. A method for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the method comprising the steps of: receiving a path reservation message; scanning the path reservation message for a path key object; extracting, in response to a path key object, a PCE ID and path key; generating a path computation request containing the extracted PCE ID and path key; and transmitting the path computation request to the PCE identified by the PCE ID.

11. The method of claim 10, further comprising: receiving a response to the path computation request from the PCE, the response including a computed path segment; and using the computed path segment to complete a path reservation request.

12. A system configured to retrieve computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the system comprising: a processor; a network interface to receive a path computation request issued by a Path Computation Client (PCC); a PCE process executed by the processor to compute one or more path segments in response to the path computation request and associate each path segment with a path key; and a memory to store the one or more path segments with each associated path key.

13. The system of claim 12, further comprising: a network interface to return, to the PCC, a path computation response, including the path key and a computed path containing compressed path descriptions of the computed path segment.

14. The system of claim 13, wherein a PCE identification is included with the path key, the PCE identification identifying the PCE process returning the path computation response.

15. A system for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the system comprising: a network interface to receive a path reservation message; a processor to i) scan the path reservation message for a path key object, ii) extract, in response to a path key object, a PCE ID and path key, and iii) generate a path computation request containing the extracted PCE ID and path key; and a network interface to transmit the path computation request to the PCE identified by the PCE ID.

16. An apparatus adapted to retrieve computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the apparatus comprising: means for receiving a path computation request issued by a Path Computation Client (PCC); means for computing one or more path segments in response to the path computation request; means for associating each path segment with a path key; and means for storing the one or more path segments with each associated path key.

17. A computer readable medium containing executable program instructions for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the executable program instructions comprising program instructions for: receiving a path computation request issued by a Path Computation Client (PCC); computing one or more path segments in response to the path computation request; associating each path segment with a path key; and storing the one or more path segments with each associated path key.

18. A computer readable medium containing executable program instructions for retrieving computed path segments across one or more domains of a computer network in accordance with a stateful path computation element (PCE) model, the executable program instructions comprising program instructions for: receiving a path reservation message; scanning the path reservation message for a path key object; extracting, in response to a path key object, a PCE ID and path key; generating a path computation request containing the extracted PCE ID and path key; and transmitting the path computation request to the PCE identified by the PCE ID.