This invention relates to a connection-oriented network, and more specifically to a method and an apparatus for resuming traffic rapidly after a failure in a network element.
Routing traffic using shortest path algorithms (e.g., Interior Gateway Protocol (IGP) such as implemented by Open Shortest Path First (OSPF) or Intermediate System to Intermediate System (IS-IS)) contributes significantly to congestion problems in a network. Because IGP is topology-driven, bandwidth availability and traffic characteristics are not considered when making routing decisions. An overlay model, such as using EP-over-ATM or IP-over-Frame-Relay, provides a virtual topology on top of the physical topology and can alleviate traffic congestion. The overlay model supports constraint-based routing to configure and maintain a virtual topology.
In a connection-oriented network, such as X.25, Frame Relay, or ATM networks, packets are routed based on a virtual topology consisting of virtual circuits (routes). At the beginning of a transmission, a connection is established and every packet belonging to a given connection is transmitted through the same established route. In practice, a communications protocol, such as RSVP, signals a router to reserve bandwidth for real-time transmission.
In conventional connection-oriented networks, such as IP-over-ATM, each node communicates with every other node by a set of permanent virtual circuits (PVC) that are configured across the ATM physical topology. In the conventional model, the nodes only have knowledge of the individual PVCs that appear to them as simple point-to-point circuits between two nodes. Furthermore, the physical paths for the PVC overlay are typically calculated by an offline configuration utility on an as-needed basis, such as when congestion occurs, or a new link is added, etc. The PVC paths and attributes are globally optimized by an offline configuration utility based on link capacity and historical traffic patterns. The offline configuration utility can also calculate a set of secondary PVCs that is ready to respond to failure conditions.
The connection-oriented network has an advantage over other types of network models in that it does not require complete address information for every packet after the connection has been established. Instead, only a short connection identifier is included with each packet to define the virtual circuit to which the packet belongs. For example, in a Multiprotocol Label Switching (MPLS) framework, a label is attached to a packet as it enters the network. Forwarding decisions are based on the attached label without consulting the original packet headers.
Internet Protocol traffic is widely carried over the Synchronous Optical Network (SONET) lines, either using ATM as a management layer or over SONET directly. In such a network, failure of a network element will cause a loss of service until a new connection can be established.
SONET uses a self-healing ring architecture capable of rerouting traffic if a line goes down. The restoration time is on the order of 50 milliseconds. For service providers who need to provide voice over IP and other high reliability services, a fast reroute time compatible with the SONET restoration time of 50 milliseconds is required.
There are generally two conventional approaches to providing fast reroute, both requiring the use of signaling protocols. One approach is to signal the failure back to an ingress node where the packet enters the network. The ingress node recomputes and establishes an alternative virtual circuit as soon as possible. However, given that the signaling time required to propagate a signal for a round-trip across the continental United States is about 75 milliseconds, this approach is too slow to be compatible with SONET's restoration time of 50 milliseconds.
In a second conventional approach, a master server monitors the network and pre-establishes alternative virtual circuits. The master server is notified of a failure and directs traffic to an alternative virtual circuit. However, the signaling between the master server and the failed elements still causes delay. Furthermore, if the failed node or link carries multiple virtual circuits, multiple signaling can create a peak in both the processing requirements and the bandwidth utilization.
This invention offers dynamic rerouting in a network based on pre-calculated alternative routes.
Unlike the conventional system in which one node, whether a master server or an ingress node, establishes an alternative route after a failure is detected, one or more nodes along an established route pre-compute alternative routes from the node to the destination device.
The invention provides a method and an apparatus for a network to continue operating at times of failure without requiring signaling back to an ingress node or a master server.
In one aspect, the invention is directed to a network for forwarding packets from a source device to a destination device. The network has a plurality of network elements including nodes and connecting links, a master server for monitoring the network and establishing an initial route between the source device and the destination device. One or more of the nodes along the initial route have a processor to compute an alternative route for the initial route, a storage space to store the initial route and the alternative route, a mechanism to detect failure in a downstream network element in the initial route, and a forwarder to automatically forward a packet to the next node.
Aspects of the invention can include one or more of the following features. The network can be connection-oriented with a plurality of established initial routes. The nodes can be label-switched routers supporting Multiprotocol Label Switching (MPLS). The processors at one or more of the nodes along the initial route can pre-compute an alternative route not including a failed downstream node and link on the initial route. The alternative route can also not include a plurality of nodes that are identified as likely to fail with the downstream node and link according to network configuration data.
The mechanism to detect failure can send communication packets to downstream nodes at regular intervals. The forwarder can forward packets by swapping a label on a packet with another value before forwarding the packet to the next node.
In another aspect, the invention is directed to a method of forwarding packets from a source device to a destination device. The method includes determining an initial route, determining an alternative route, forwarding packets on the initial route, detecting a failed element, and automatically forwarding packets on the alternative route without communicating with either the upstream nodes or the master server.
Aspects of the invention can include one or more of the following features. The method of determining the initial route can begin with a shortest path algorithm. The shortest path can be refined according to administrative constraints, and is established as the initial route. The administrative constraints can include bandwidth allocation and hop limit. The initial route can be prioritized to establish a hierarchy for preemption in routing network traffic. Determining the alternative route can comprise determining a shortest route from a node preceding the failed element to the destination device within the network, excluding the failed element on the initial route, and establishing the alternative route for forwarding packets. Failures within the system can be detected locally by a node preceding the failed element without requiring notification of a master server or an ingress node.
The method can further include computing the alternative route, reserving bandwidth available on the initial route, generating the alternative route by invoking a routing protocol, refining the alternative route by excluding the failed element, and establishing the alternative route.
The bandwidth allocation can include dynamic balancing of capacity of nodes and links. The method determining the alternative route can include reserving bandwidth available on the initial route, identifying a plurality of nodes associated with the failed node according to network configuration information, generating the alternative route excluding the failed node and the plurality of nodes, and establishing the alternative route.
In another aspect, the invention is also directed to a method for rerouting, locally, packets traveling on an established route when a node in a network of interconnected nodes fails. The method includes computing, at a plurality of intermediary nodes along the initial route, an alternative route leading from the computing node to the destination device of the established route, determining locally that the established route has failed, and automatically forwarding packets according on the alternative route.
Aspects of the invention can include one or more of the following features. The method of computing the alternative route can include reserving bandwidth available on the initial route, identifying a plurality of nodes associated with the failed node according to network configuration information, generating the alternative route excluding the failed node and the plurality of nodes, and establishing the alternative route. For network efficiency, the system can merge a set of established routes with the same destination device and same administrative constraints as the initial route, identify a common node after which the set of established routes and the initial route utilize the same network elements, and establish a new merged route from the common node to the destination device.
In another aspect, the invention is also directed to an apparatus and a method for rapidly resuming, at times of failures, network traffic in a connection-oriented network by using an alternative route pre-computed and stored locally in nodes along an initial route without requiring signaling of upstream nodes or a master server.
Implementations of this invention offer many advantages, including minimizing the time delay in routing network traffic after failure in a network element. Currently network traffic is normally put on hold until notification of failure is delivered to the a master server or an ingress node. This notification requirement causes additional time delay, and also raises concerns regarding reliability of notification delivery. This invention removes both obstacles by pre-computing and storing an alternative route locally for rapid resumption of traffic at times of failure.
A fully implemented version of this invention will also enhance the reliability of transmission and reduce the probability of packet loss in a network. These and other advantages and features will be apparent from the following description and claims.
a is a schematic diagram of a connection-oriented network supporting fast reroute.
b is a flow diagram of MPLS routing along a LSP.
a is a schematic diagram of an initial route.
b is a schematic diagram of an alternative route for the initial route.
a is flow diagram demonstrating steps for implementing fast reroute in a connection-oriented network.
b is a flow diagram for steps performed during the initialization step shown in
a is a flow diagram detailing the steps for generating an alternative route.
b is a flow diagram showing how routes can be merged for state optimization.
c is a flow diagram showing the steps for generating an alternative route excluding multiple network elements associated with a failed network element.
a shows a memory element for storing route information at alternative-route-enabled nodes.
b shows the data structure for an initial route.
c illustrates the data structure for an alternative route.
The following detailed description provides specific details of the present invention. However, those skilled in the art will appreciate that the present invention may be practiced without these specific details. Well known methods, procedures, components, protocols, and circuits are not described in detail as they are presumed to be within the knowledge of those skilled in the art.
The present invention is related to routing packets in a connection-oriented network having routers interconnected by links. For illustration purposes, the following detailed description refers to Multiprotocol Label Switching (MPLS) as the connection-oriented framework. Those skilled in the art will understand that MPLS is only one type of connection-oriented framework. Other types of connection-oriented subnetworks include, but are not limited to, X.25, Frame Relay, and POTS (Plain Old Telephone Service). The present invention may be applied to any type of connection-oriented subnetwork using the structures and methods described herein and is not limited to the MPLS framework.
a refers to a network 140 for routing traffic from source device 100 to destination device 110. Network 140 is composed of a set of interconnected nodes, such as node 130. Nodes are connected to other nodes through links, such as link 150. Each link, including link 150, has an associated bandwidth, the aggregate of which define an amount of traffic that can be carried in the network. In one implementation, network 140 is composed of routers (nodes), interconnected by leased lines (links), such as T1 or T3 links. Master server 120 monitors the status of network 140. Master server 120 calculates, using an off-line configuration utility, an initial route that will route IP packets from source device 100 to destination device 110 through network 140.
MPLS, as adopted in this invention, is responsible for directing flow of IP packets along a predetermined path across a network. A route, in the MPLS framework, is called a label-switched path (LSP), as opposed to a PVC in the IP-over-ATM model. As shown in
If no elements in a LSP fails, the packet is forwarded as described above. One or more nodes along an LSP can be “alternative-route-enabled,” which means that alternative routes are pre-calculated and stored at these nodes along an initial route configured by master server 120. When a failure is detected, the most immediate alternative-route-enabled node upstream from the failed element adopts the alternative route to route traffic, thus avoiding the failed node and element. For example, in
a gives an overview of one implementation of this invention, detailing steps for forwarding IP-packets from source device 100 to destination device 110. The process begins at step 300. As a preparatory step, initialization steps are performed at step 305, the details of which are discussed in conjunction with
Referring back to
If no failure is detected, packets are forwarded along the initial route or alternative route until the traffic ends at step 325 and the process finishes in step 330. Single or multiple failures in the system can be supported by directing traffic to alternative routes stored locally at alternative-route-enabled nodes.
In one implementation, initial routes may optionally have a priority attribute attached. Initial routes with higher priority may preempt the traffic of other routes competing for the same network resources. Preemption allows a network to remove existing, established, low priority traffic for the purpose of accommodating higher priority traffic, thereby introducing a concept of “traffic class.” In times of congestion, higher class traffic may get preferential treatment.
a details the steps of computing an alternative route. The process (step 308 of
In one implementation, the generated alternative routes are not screened for conflicts with administrative constraints so as to speed the processing and minimize overhead burden. In such an alternative route, a link failure results in rerouting of traffic that the upstream node was sending down the failed link. This capacity of traffic is known to the upstream node, so the upstream node can send a request to an immediately downstream node in the alternative route to reserve the necessary bandwidth.
Unlike bandwidth reservation for an initial route, which is granted or denied, bandwidth request for an alternative route can be double-booked. If the request is for an initial route, the system identifies the expected failed node and link. With this information, it is possible to compute independently the minimum bandwidth required. If it is for an alternative route, the network administrator will first examine to see if the requests are for different failed nodes. If so, and if the system can accommodate each request separately, the system grants both requests using double accounting to maximize bandwidth usage. If the requests are for the same failed node, the system will compute the sum of the different requests to see if it can accommodate the combined sum.
For better system efficiency, routes with identical destination device and topology can be merged, as outlined in
c describes another feature of the invention for dealing with multiple failed elements. For example, certain links and nodes in a network are likely to fail together; such data can be stored in the system configuration information. Therefore, upon detecting a failed element in step 560, the system configuration information is examined to identify other links and nodes which are potential simultaneous failure candidates in step 565. After they are identified, an alternative route excluding all identified elements and the failed element is generated in step 570.
a is a graphical representation of route information 600 stored in the storage space within a node. All alternative-route-enabled nodes store the topology of an initial route 601, and an alternative route 602 to be used in case the initial route fails.
The present invention has been described in terms of specific implementations, which are illustrative of the invention and not to be construed as limiting. Other implementations are within the scope of the following claims.
This application is a continuation of U.S. patent application Ser. No. 12/908,902, filed Oct. 21, 2010, which is continuation of U.S. patent application Ser. No. 12/254,906, filed Oct. 21, 2008 (now U.S. Pat. No. 7,843,808), which is a continuation of U.S. patent application Ser. No. 09/354,640, filed Jul. 15, 1999 (now U.S. Pat. No. 7,457,233). The disclosures of these applications are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5058105 | Mansour et al. | Oct 1991 | A |
5065399 | Hasegawa et al. | Nov 1991 | A |
5115495 | Tsuchiya et al. | May 1992 | A |
5539815 | Samba | Jul 1996 | A |
5546542 | Cosares et al. | Aug 1996 | A |
5748611 | Allen et al. | May 1998 | A |
5856981 | Voelker | Jan 1999 | A |
5872773 | Katzela et al. | Feb 1999 | A |
5999286 | Venkatesan | Dec 1999 | A |
6021113 | Doshi et al. | Feb 2000 | A |
6034946 | Roginsky et al. | Mar 2000 | A |
6041057 | Stone | Mar 2000 | A |
6047331 | Medard et al. | Apr 2000 | A |
6122283 | Lee | Sep 2000 | A |
6122753 | Masuo et al. | Sep 2000 | A |
6141319 | Dighe et al. | Oct 2000 | A |
6163525 | Bentall et al. | Dec 2000 | A |
6167025 | Hsing et al. | Dec 2000 | A |
6215765 | McAllister et al. | Apr 2001 | B1 |
6252853 | Ohno | Jun 2001 | B1 |
6282170 | Bentall et al. | Aug 2001 | B1 |
6336129 | Ise et al. | Jan 2002 | B1 |
6359857 | Ahmad et al. | Mar 2002 | B1 |
6366556 | Ballintine et al. | Apr 2002 | B1 |
6430150 | Azuma et al. | Aug 2002 | B1 |
6466985 | Goyal et al. | Oct 2002 | B1 |
6496479 | Shionozaki | Dec 2002 | B1 |
6538416 | Hahne et al. | Mar 2003 | B1 |
6560218 | McAllister et al. | May 2003 | B2 |
6600724 | Cheng | Jul 2003 | B1 |
H0002075 | Gnauck et al. | Aug 2003 | H |
6606297 | Magill et al. | Aug 2003 | B1 |
6633544 | Rexford et al. | Oct 2003 | B1 |
6697329 | McAllister et al. | Feb 2004 | B1 |
6717920 | Cheng | Apr 2004 | B1 |
6775266 | Furtenback et al. | Aug 2004 | B1 |
6775295 | Lothberg et al. | Aug 2004 | B1 |
6785277 | Sundling et al. | Aug 2004 | B1 |
6813242 | Haskin et al. | Nov 2004 | B1 |
6856627 | Saleh et al. | Feb 2005 | B2 |
6857026 | Cain | Feb 2005 | B1 |
6992978 | Humblet et al. | Jan 2006 | B1 |
7002917 | Saleh | Feb 2006 | B1 |
7058845 | Fujita | Jun 2006 | B2 |
7061896 | Jabbari et al. | Jun 2006 | B2 |
7075889 | Shiozawa | Jul 2006 | B2 |
7093027 | Shabtay et al. | Aug 2006 | B1 |
7126907 | Carpini et al. | Oct 2006 | B2 |
7257731 | Hunt et al. | Aug 2007 | B2 |
7298693 | Owens et al. | Nov 2007 | B1 |
7315510 | Owens et al. | Jan 2008 | B1 |
7343423 | Goguen et al. | Mar 2008 | B2 |
7370119 | Provine et al. | May 2008 | B2 |
7373401 | Azad | May 2008 | B1 |
7380017 | Weil et al. | May 2008 | B2 |
7457233 | Gan et al. | Nov 2008 | B1 |
7843808 | Gan et al. | Nov 2010 | B2 |
20030053463 | Vikberg et al. | Mar 2003 | A1 |
20110090784 | Gan et al. | Apr 2011 | A1 |
Entry |
---|
Semeria, “Traffic Engineering for the New Public Network,” Jan. 25, 1999, downloaded from www.juniper.net/leadingedge/whitepapars, 19 pgs. |
Callon et al., Network Working Group Internet draft, “A Framework for Multiprotocol Label Switching,” Nov. 21, 1997, 65 pgs. |
Rosen et al. Network Working Group Internet draft, “MPLS Label Stack Encoding,” Sep. 1998 21 pgs. |
Awduche et al., Network Working Group Internet draft, “Requirements for Traffic Engineering Over MPLS,” Oct. 1998, 27 pgs. |
Awduche et al., Network Working Group Internet draft, “Extentions to RSVP for LSP Tunnels,” Feb. 1999, 58 pgs. |
Smit et al., Network Working Group Internet draft, “IS-IS extentions for Traffic Engineering,” Feb. 1999, 7 pgs. |
Sonet 101, product information, Nortel, 67 pgs. |
Nortel, “Introduction to Sonet Networking,” product and service information, Oct. 1996, 38 pgs. |
Gersht et al. “Architecture for Restorable Call Allocation and Fast VP Restoration in Mesh ATM Networks,” IEEE International Conference on Communications (Jun. 8, 1997) (pp. 1158-1163). |
Wipusitwarakun et al. “VP's Priority Based Restoring Function Enhanced Self-heating Algorithm,” IEICE Transactions on Communications, JP, Institute of Electronics Information and Comm. Eng., Tokyo, vol. E81-B, No. 11 (Nov. 1, 1998) (pp. 2100-2108). |
Hagard et al. “Multiprotocol Label Switching in ATM Networks,” Ericsson Review, SE, Ericsson, Stockholm, No. 1, 1998, p. 32-39. |
Number | Date | Country | |
---|---|---|---|
20130315056 A1 | Nov 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12908902 | Oct 2010 | US |
Child | 13959068 | US | |
Parent | 12254906 | Oct 2008 | US |
Child | 12908902 | US | |
Parent | 09354640 | Jul 1999 | US |
Child | 12254906 | US |