US 7,315,510 B1Grant
Method and apparatus for detecting MPLS network failures
Issue Date:2008-01-01
•24 Claims
•3 Drawing Sheets
Abstract
Recovery time upon the failure of a link or switching system in an asynchronous data network can be minimized if downstream data switches can provide upstream messages to upstream switching systems indicating to upstream switching systems that the downstream traffic arrived in tact and was properly handled. In one embodiment, the loss or failure of the upstream status message to an upstream switching system, causes an upstream switching system to reroute data traffic around a failed link or failed switch with a minimal amount of lost data.
Metadata
Assignee
- Tellabs Operations, Inc.
Inventors
- Kenneth R. Owens
- Srinivas V. Makam
- Changcheng Huang
- Vishal Sharma
Application Information
Application Number:US 09/692,885
Filing Date:2000-10-20
Priority Date:1999-10-21
Art Unit:2616
Classifications
IPC:
G06F11/00H04L12/28H04L12/56
Patent Drawings (3 sheets)
Description
Related Applications
[0001] This application claims priority under 35 U.S.C. §119(e) to provisional application Ser. Nos. 60/160,840, filed Oct. 21, 1999; 60/161,277, filed Oct. 25, 1999; and 60/187,798, filed Mar. 8, 2000, the entire writing and content of which is incorporated by reference.
Field of the Invention
[0002] This invention relates to data networks. In particular this invention relates to a method and apparatus for automatically routing a message upstream through a multi-protocol label switching (MPLS) network so as to trigger the re-routing of data onto an alternate path through the MPLS network.
Background of the Invention
[0003] Multiprotocol Label Switching (MPLS) is a new technology that combines OSI layer 2 switching technologies and OSI layer 3 routing technologies. The advantages of MPLS over other technologies include the flexible networking fabric that provides increased performance and scalability. This includes Internet traffic engineering aspects that include Quality of Service (QoS)/Class of Service (COS) and facilitate the use of Virtual Private Networks (VPNs).
[0004] The Internet Engineering Task Force (IETF) defines MPLS as a standards-based approach to applying label switching technology to large-scale networks. The IETF is defining MPLS in response to numerous interrelated problems that need immediate attention. These problems include, scaling IP networks to meet the growing demands of Internet traffic, enabling differentiated levels of IP-based services to be provisioned, merging disparate traffic types onto a single IP network, and improving operational efficiency in a competitive environment.
[0005] The key concept in MPLS is identifying and marking IP packets with labels and forwarding them to a modified switch or router, which then uses the labels to switch the packets through the network. The labels are created and assigned to IP packets based upon the information gathered from existing IP routing protocols.
[0006] The label stack is represented as a sequence of “label stack entries”. Each label stack entry is represented by 4 octets.
[0007]
[0008] The label stack entries appear after the data link layer headers, but before any network layer headers. The top of the label stack appears earliest in the packet, and the bottom appears latest. The network layer packet immediately follows the label stack entry which has the S bit set.
[0009] Multi-protocol label switching (MPLS) networks are typically comprised of several packet-based switching systems interconnected by a variety of media (e.g., coaxial or fiber optic cable, unshielded twisted pair or even point-to-point microwave wireless) in a mesh-topology network similar to the public switched telephone network. In such a network, there might be several paths through the network between any two endpoints. MPLS networks carry data as packets wherein each packet includes a label on identifying a switched path through the network. The data label is appended to data packets so as to define a pathway through the network over which the data packets are to be routed.
[0010] A problem with any data network, including an MPLS network, is the amount of time required to recover from either a link failure or a switch failure. Empirical data shows that the time required to recover from a network failure can take several seconds to several minutes, an unacceptably long time. A method and apparatus by which the recovery time for a link or switch failure can be reduced to perhaps less than a few hundred milliseconds would be a significant improvement over the prior art fault recovery mechanisms used on MPLS networks to date. A method and apparatus by which a switch over from a working path to a protection path would facilitate MPLS network reliability.
Summary of the Invention
[0011] In an MPLS data network comprised of various transmission media linking various types of switching systems, network fault recovery time is reduced by using a reverse-directed status message that is generated by a data switch that is down-stream from a switching system from which data is received. The reverse-directed or upstream status message is sent over a pre-determined pathway (i.e. through pre-determined switches and/or over pre-determined data links) which originates from a destination switch or node in an MPLS network to upstream switching systems. This so-called reverse notification tree carries a message or messages that are used to indicate the functionality (or non-functionality) of the downstream switch, switches or links of the MPLS network. As long as an upstream MPLS switching system continues to receive the reverse-directed status message from a downstream switch via the reverse notification tree, the switching systems that receive such a message consider the downstream switch and pathways to be in intact. Accordingly, data packets continue to be sent downstream for subsequent routing and/or processing. If the reverse-directed status message is lost or discontinued, either because of a switch failure or a link failure, the upstream switching system considers the downstream switch or link to have failed and thereafter begins executing a procedure by which data is rerouted over an alternate data path through the network. In the preferred embodiment, the alternate data path over which downstream information ins sent is a pre-established protection path and is known to a protection switch in advance, thereby minimizing data loss attributable to the time it might take to calculate a dynamic alternate protection path.
[0012] Switches in the network and their interconnections can be modeled using a directed acyclical graph by which a downstream switch knows the identity of the upstream switch to which the failure notice should be sent. In the preferred embodiment, at least one upstream switch routing the MPLS data re-directs data onto a protection path through the network between the same two endpoints by using messages carried over a different pathway, discussed hereinafter and referred to as a reverse notification tree. By way of the reverse notification tree, data loss caused by either a link or switch failure can be minimized by the prompt rerouting of the data through an alternate or recovery data path through the network.
Brief Description of the Drawings
[0013] FIG. 1 shows a simplified block diagram of an MPLS protection configuration.
[0014] FIG. 2 depicts exemplary message flows in an MPLS network.
Detailed Description of the Preferred Embodiment
[0015] FIG. 1 shows a simplified block diagram of a packetized-data switching network 100. Each of the squares shown in FIG. 1 including boxes represented by reference numerals 102, 104, 106, 108, 110, 112, 114, 116, 118 and 120 represent one or more types of asynchronous switching systems that asynchronously receive data in e.g., packets, cells or frames from an “upstream” switch and route, direct, couple or otherwise send the data onward to another “downstream” switch logically closer to the ultimate destination for the data. By way of example, these switching systems might be internet protocol (IP) routers, asynchronous transfer mode (ATM) switches, frame relays switches or other types of packetized-data switching systems implemented to receive packetized data over a transmission line and reroute the data onto one or more output ports to which are connected transmission media coupled to other switching systems.
[0016] In FIG. 1 , switching system number 1, (identified by reference numeral 102) is coupled to another switching system, no. 2, (represented by reference numeral 104) and switching system no. 5 (represented by reference numeral 120) via links L12 and P25 respectively. Switching system no. 2 and no. 5 are “downstream” from no. 1; no. 1 is considered to be “upstream” from switch no. 2 and no. 5.
[0017] Similarly switching system no. 3, (represented by reference numeral 106) is coupled to switching systems 2, 4 and 9 (represented by reference numerals 104, 108 and 116 respectively) via transmission links L23, L34, and L93 respectively.
[0018] In routing data between switch no. 1 (represented by reference numeral 102) and switch no. 7 (represented by reference numeral 112) data might be routed between these two endpoints through a “primary” path that is comprised of links that logically or physically couple switches 2, 3, 4, 6 and 7 (identified by reference numerals 104, 106, 108, 110 and 112 respectively). The physical or logical links of the primary path between the endpoints which is 1 and 7 are represented by the vectors designated L12, L23, L34, L46 and L67. This path is known in the art as the working or primary path through the network. The links of the various paths shown in FIG. 1 (represented by the vectors L12, L23, L34, L46 and L67), and therefore the paths themselves, might be constructed of direct pathways (e.g., fiber optic cable, coaxial cable, unshielded twisted pairs of copper wires, or microwave radio) between the various switches. Alternate embodiments of the paths or links between switches of the network of FIG. 1 would also include using direct pathways, and intermediate switches or switch networks, (not shown in FIG. 1 , but still part of the path or link coupling one or more switching systems to another). By way of example and not of limitation, the data switches shown in FIG. 1 might be IP switches but such IP switches could be linked together using one or more ATM switches or ATM networks.
The MPLS Protection Path
[0019] In an MPLS network, there is almost always a “protection” path, which is an alternate path through the network linking two endpoints. The protection path entry and exit points are usually accessible to only protection switches. A protection switch is a switch that can re-route traffic onto a protection pathway. Like the other links described above, a protection pathway can be comprised of direct data paths, but also switches or switching systems, by which data can be sent through a network between two or more endpoints.
[0020] In an MPLS network, a protection path is set up using at least one protection switch element so as to be able to carry data from a source to a destination in the event the primary path or switch thereof fails for one reason or another. The operation of a protection switch is shown in FIG. 1 by way of example.
[0021] In FIG. 1 , a working path between switch 1 and 7 exists through switches 1, 2, 3, 4, 6 and 7 and the links between the switches. A protection path for the portion of the working path that runs through switches 2, 3, 4 and 6 is the path designated by links P25 and P27 and which runs through switch 5, (identified by reference numeral 120). The protection path extends between endpoint switches 1 and 7 but through only switch 5 (identified by reference numeral 120). Alternate embodiments of a protection path might extend through multiple switches. In the network 100, either a link or switch loss between switch 1 and 7 can be overcome by re-routing traffic for switch 2 through switch 5 instead. Switch 5 then routes the data to switch 7. Switch 1 (identified by reference numeral 102) is considered to be a protection switch element.
[0022] Another working path between switch 8 and switch 7 of the network 100 (identified by reference numerals 114 and 112 respectively) exists through switches 9, 3, 4, 6 & 7 (identified by reference numerals 116, 106, 108 and 110 respectively) and the links between them. A protection path for data from switch 8 (reference numeral 114) to switch 7 (reference numeral 112) through the network 100 exists via switch 10, (reference numeral 118) such that if data traffic from switch 8 (reference numeral 114) is lost somewhere between switch 9 (reference numeral 116) and switch 7 (reference numeral 112), switch 9 can re-route such data traffic to switch 10 (reference numeral 118). Switch 10 can then route such data to switch 7. Switch 9 is therefore considered to be a protection switch element.
[0023] If an alternate data path, i.e. a protection path, is pre-determined, i.e. set up or established in advance, data loss attributable to a switch or link failure can be minimized. If a protection switch is pre-programmed to re-route data upon its receipt of an appropriate command or signal, the protection switch element can almost immediately start sending data to the proper destination via the protection path.
The Liveness Message
[0024] In the event of a pathway failure causing downstream data to be lost at a downstream switch, such as by either a switch failure or a link failure, anywhere along a primary or working path, a protection switch element (PSL), such as switch no. 1 (identified by reference numeral 102) can re-route data traffic through the protection path so as to have the data for the endpoint switch no. 7 delivered as quickly as possible to the endpoint at switch no. 7 (identified by reference numeral 112). The ability to re-route data to a protection path is made considerably more valuable if the decision to switch over to a protection path is based upon an affirmative notice that a switch over is needed. In one embodiment, this affirmative notice is in the form of an upstream liveness message, the loss of which indicates a pathway failure. As long as a liveness message is received at an upstream switch from a downstream switch, the upstream switch can assume that the pathway between the two switches is intact and that the downstream switch is functional.
[0025] The liveness message is sent upstream, and is repeated, so long as downstream data is received. In one embodiment, the liveness message is repeated periodically, at some appropriate repetition rate, however, an alternate embodiment includes sending an upstream message aperiodically, and also without regard to the time between messages. Downstream data loss at a switch will trigger the switch to inhibit upstream-directed liveness messages.
[0026] In another embodiment, a predetermined downstream liveness message is sent instead of, or in addition to downstream data. The receipt of a such a downstream liveness message will cause a recipient switch to maintain its generation of upstream liveness messages. For purposes of claim construction, downstream liveness messages and downstream voice or downstream data (considered to be interchangeable for claim construction purposes) are considered to be equivalent under the rubric of “a first data message” or a “first message,” the reception of which can either inhibit an upstream liveness message, or in alternate embodiments, trigger an upstream liveness message.
[0027] Those skilled in the art will appreciate that while the loss of a liveness message can trigger a protection switch of data to a protection path, an equivalent alternate embodiment of the invention includes a method by which a protection switchover is initiated or occurs upon the receipt of either a liveness message or a notification message to a protection switch element. In such a case, the liveness message and/or the notification acts as a trigger event to cause information to be re-routed onto the protection path.
[0028] In the event of a switch or link failure anywhere between the path endpoint switches 1 and 7, data re-routing is accomplished faster by using a reverse-directed status message that is sent backward or upstream toward the protection switch element no. 1 (reference numeral 102) by one or more of the switches 2, 3, 4, 6 or 7 (reference numerals 104, 106, 108, 110 or 112) of the primary pathway, links L12, L23, L34, L46, L67. In the preferred embodiment this reverse direction data message is known as a “liveness message” the format of which is a design choice and dependent upon nature of the switches of the network 100, but the function of which is to indicate to upstream switches that the data traffic sent to the downstream switch arrived intact and on time.
[0029] The structure of a liveness message will vary depending upon whether the network switches are ATM, IP, Ethernet or other types of switches, as those skilled in the art will recognize. Unlike known fault detection methods, the liveness message is not a copy, or loop-back of the downstream data. The salient aspect of the liveness message is that it is an informational status message, preferably sent at periodic intervals between adjacent nodes, indicating the operational condition of the switch from which it was sent. As set forth above, alternate embodiments include sending a liveness message aperiodically. In at least one of the foregoing embodiments, the fact that the liveness message is received at an upstream switch (with respect to the downstream data) is evidence that the link between the switches, over which downstream data would be sent, is intact and that the switch that generated the liveness message is at least somewhat functional.
[0030] While the preferred embodiment contemplates that the liveness message is sent upstream from a switch, directly to the switch that sent the downstream data, alternate embodiments of the invention contemplate that a liveness message, or equivalent thereof, could be sent in both upstream and downstream directions, between other nodes, or from one switch to an intermediate transfer point, which for purposes of claim construction are considered to be equivalent embodiments. By way of example, with reference to FIG. 1 , switch no. 4 (identified by reference numeral 108) will send a liveness message, upstream to switch no. 3 (reference numeral 106) in response to data sent downstream (or perhaps a downstream liveness message, sent downstream) from switch no. 3 to switch no. 4. If the liveness message from switch no. 4 is lost by or not received by switch no. 3, switch no. 3 can infer that either the link R43 between the two switches failed, or switch no. 4 failed. If switch no. 3 was carrying data from switch no. 9 (reference no. 116) and which is a protection switch element having access to a protection path, switch no. 3 would need to inhibit its liveness message to switch no. 9 or generate an error message to switch no. 9, thereby instructing switch no. 9 to re-route traffic from switch no. 3, to the protection path through switch no. 10 (reference numeral 118)
[0031] As for data routed through switch no. 3 that comes from switch no. 2 (reference numeral 104), a liveness message loss from switch no. 4 will require switch no. 3 to inhibit the liveness message to switch no. 2, or send an error message to switch no. 2. This procedure is then repeated to switch no. 1, instructing switch no. 1 to make a protection switch through switch no. 5 (reference no. 120).
[0032] When a liveness message is lost, its failure is considered to be indicative of a path failure of either a link or a switch. Still other embodiments of the invention contemplate sending a downstream liveness message, sent from an upstream switch to a downstream switch thereby indicating to a downstream switch that the upstream switch and link are functional.
[0033] As set forth above, the format of a liveness message will depend upon the type of switching systems used in the network. IP switches and ATM switches will need to comply with their respective protocols. Alternative embodiments of the invention would certainly contemplate other sorts of liveness messages having different formats with the salient feature of the message being that the message indicates to an upstream switch that downstream directed data messages were received by a downstream switch intact.
[0034] In FIG. 1 , the links over which reverse notification status messages (i.e. the upstream liveness messages) are sent, are designated by the reverse directed vectors, one of which is shown in FIG. 1 (and identified by reference numeral R76). By way of example if link L67 should fail causing a data loss to the endpoint switch no. 7, the corresponding loss of the liveness message ordinarily sent from switch 7 to switch 6 would provide an indication to switch no. 6 that either the link or the switch 7 failed whereupon switch no. 6 would begin notifying the protection switch (switch no. 1) upstream from it by way of a reverse notification message sent on reverse link R64 that would be sent to switch no. 4, (represented by reference numeral 108). Similarly, switch no. 4 would thereafter return a reverse notification message on reverse link R43 to switch no. 3. Switch no. 3 returns another reverse notification message on reverse link R32 to switch 2 which then returns a reverse notification message on reverse link R2, to the origination node 1.
[0035] The ultimate destination of the upstream message, and in this case the reverse notification message, is a switching node (i.e. a switch or switching system) that is capable of re-routing downstream traffic, data or messages onto a different path, i.e., a protection path, usually comprised of at least a different transmission route, possibly including a different transmission media as well (coax to fiber; fiber to microwave etc.). Whether the upstream message goes through another switch on its way to the switching node (which has the capability of re-routing data to the protection path) or is directly sent to the switching node from a downstream switch around an intermediate switch (for example, sending a liveness message directly from switch 6 to switch 1) would still provide equal functionality in that the switching node will eventually receive notification that it needs to re-route traffic, data or message onto the protection path. Sending the aliveness message directly to the protection switch or routing the aliveness message via intervening switches are considered to be equivalent embodiments for purposes of claim construction.
[0036] Inasmuch as switch no. 1 in FIG. 1 is designated as a “protection switch element” meaning that it is coupled to and capable of routing data onto a protection path P25, the protection switch element 1 (identified by reference numeral 102) reroutes traffic to switch no. 7 via a protection path designated by P25 and P57 and that runs through switch no. 5 (identified by reference numeral 120).
[0037] In the preferred embodiment, the switches of the network maintain tables of network switches upon which incoming data is received and a table of network switches to which outgoing data is routed. By keeping a record of where outgoing data from a switch originates from, it is possible for a switch of the network 100 to promptly notify an upstream switch of a downstream link or switch failure.
[0038] In the process described above, each of the switches of the network sequentially notifies at least one switch upstream from it. Alternate (and for purposes of claim construction, equivalent) embodiments of the invention could certainly provide upstream notification messages directly from any downstream switch to every other upstream switch in a pathway. In such an embodiment, switch no. 6 might send a reverse notification message directly to the protection switch element 1 via a direct link thereby notifying the protection switch to immediately reroute data to the protection path P27 and P57 via switch no. 5. Switch no. 6 might also send a reverse notification (liveness) message to the other switching systems of the network as well.
The Reverse Notification Tree
[0039] The implementation of the upstream notification message, and its conveyance upstream to a protection switch element, is enabled by using an upstream pathway denominated herein as a reverse notification tree or “RNT.” The RNT is an “upstream” signal pathway that allows messages from a protection path end point to be sent “upstream” to one or more protection path (and working path) starting point switches, nodes or starting points. In the preferred embodiment, the RNT passes through the same switches and over or through the links that comprise the working path (albeit over different transmission media) and for claim construction purposes can be considered to be “coincident” with the working path. Alternate embodiments of the invention would include a reverse notification tree that runs through one or more switches or nodes that are not part of the working path, or which are only partly “coincident.”
[0040] With respect to FIG. 1 , node 7, identified by reference numeral 112, is the RNT starting point or head end. Nodes 1 and 9, which are identified by reference numerals 102 and 116, are the end points of the RNT and to which upstream protection switch messages would be sent from any node or switch between nodes 1, 9 and 7. Intervening nodes 3, 4 and 6, identified by reference numerals 106, 108 and 110 respectively, are constituent elements or parts of the RNT.
[0041] The RNT can be established in association with the working path(s) simply by making each switching system along a working path “remember” its upstream neighbor (or the collection of upstream neighbors whose working paths converge at a network switching element and exit as one). A table or other data structure stored in memory (such as RAM, ROM, EEPROM, or disk) of the switches of the paths can be configured to store data identifying switches coupled to a switching system in, or part of a working path as well as a protection path.
[0042] With respect to the network shown in FIG. 1 , Table 1 below shows that incoming or “Ingress” RNT messages to switch no. 3 from switch 4 are labeled “N43” (not shown in FIG. 1 ) and that these messages arrive at switch no. 3 from switch 4 at an inbound or “Ingress” interface I34 (not shown in FIG. 1 ). Because switch no. 3 receives downstream messages from two (2) different switches, (i.e. switch 2 and switch 9) both of these two upstream switches must be sent an upstream notification therefore requiring two separate upstream messages from switch 3. Upstream RNT messages to switch 2 are labeled “N32” and appear or are sent from interface I23. Upstream RNT messages to switch 9 are labeled “N93” and are sent from interface I93.
[0043]
| TABLE 1 | ||||||
|---|---|---|---|---|---|---|
| An inverse cross-connect reverse notification tree | ||||||
| table for Switch 3 of FIG. 1. | ||||||
| A | B | C | D | E | F | |
| Ingress | Ingress | Egress | Egress | Egress | Egress | |
| Label of | Interface | Label of | Interface | Label of | Interface | |
| RNT | of RNT | RNT | of RNT | RNT | of RNT | |
| N43 | I34 | N32 | I23 | N39 | I93 | |
[0044] The reverse path (upstream) to switch 3 from switch 4 is labeled N43; the switch 3 interface for this data is designated I34. An upstream message received at I34 and that is labeled N43, is sent out from switch 3, via the interfaces I23 and I93 and labeled N32 and N39 respectively.
[0045] Table 2 shows the egress and interface labels of the working or downstream path from switch 3 and the originating switches for that data.
[0046] The working path (downstream) path from switch 3 is to switch 4 and is labeled “L34.” The switch 3 interface for this data is designated “I34.” The data sent downstream from switch 3 originates from switch 2 and switch 9, which are referred to in Table 2 as “Next Hop” switches.
[0047] Switch no. 2 originates data to switch no. 3 and that data is received at switch no. 3 on interface “I2.” Data from switch no. 9 is received at switch no. 3 at interface “I9.” The RNT or upstream notification to switch no. 2 leaves switch no. 3 on its RNT interface “I23.” RNT notification to switch no. 9 leaves switch no. 3 from “I93.”
[0048]
A fault on the link between switch 3 and 4 in the downstream direction can be detected at a downstream node, switch 4 perhaps, via either a downstream data loss, a downstream liveness message loss or via a path failure (PF) or link failure (LF). A path failure (PF) is a software-detected hardware fault. A link failure (LF) is a hardware-detected hardware fault. Upon the detection of a fault, the downstream node (switch 4) will periodically transmit fault indication signal (FIS) messages to its upstream neighbor (switch 3) (via the uplink R43), which will propagate further upstream (using its inverse cross-connect table) until the FIS messages eventually reach the appropriate Protection Switch Element (switch 1 and/or 9). Receipt of an FIS message will trigger the protection switch over of data from the working path to the protection path. From Table 1, messages received at switch no. 3 are labeled “N43.” Therefore, inFIG. 1 , if link L34 has a fault, switch 4 can detect the fault via either a lost downstream liveness message from switch no. 3, or by detecting a Link Failure (LF) or Path Failure (PF) and thereafter start transmitting an FIS packet back to switch 3 on link L23 as represented by a message on link R43. From Tables 1 and 2, there are two egress messages and interfaces from switch no. 3, which identify the upstream switches that are to be “notified” of a failure downstream from switch no. 3. (The traffic in the queues of switch 3 will continue to be serviced.) By using similar tables, switch 2 in turn will propagate the FIS over the RNT back to switch 1. The actual protection switch will be performed by switch 1, after the receipt of the first FIS. Switch 3 will stop transmitting FIS messages “t” time units after the transmission of the first FIS message.
| TABLE 2 | ||||||
|---|---|---|---|---|---|---|
| An inverse cross-connect table for a hop-by-hop | ||||||
| reverse notification tree. | ||||||
| A | B | C | D | E | F | |
| Egress | ||||||
| Egress | Interface | Next Hop | Next Hop | |||
| Label of | of | IP | Egress | IP | Egress | |
| Working | Working | Address | Interface | Address | Interface | |
| Path | Path | of RNT | of RNT | of RNT | of RNT | |
| L34 | I34 | I2 | I23 | I9 | I93 | |
A fault on the link between switch 3 and 4 in the downstream direction can be detected at a downstream node, switch 4 perhaps, via either a downstream data loss, a downstream liveness message loss or via a path failure (PF) or link failure (LF). A path failure (PF) is a software-detected hardware fault. A link failure (LF) is a hardware-detected hardware fault. Upon the detection of a fault, the downstream node (switch 4) will periodically transmit fault indication signal (FIS) messages to its upstream neighbor (switch 3) (via the uplink R43), which will propagate further upstream (using its inverse cross-connect table) until the FIS messages eventually reach the appropriate Protection Switch Element (switch 1 and/or 9). Receipt of an FIS message will trigger the protection switch over of data from the working path to the protection path. From Table 1, messages received at switch no. 3 are labeled “N43.” Therefore, in
[0049] In the preferred embodiment, only one RNT is required for all the working paths that merge (either physically or virtually) to form the multipoint-to-point “forward” or “downstream” path. FIG. 1 shows that at least two (2) working paths (one path of which is comprised of switch elements 1, 2 and 3 that are identified by reference numerals 102, 104 and 106; a second path of which is comprised of switch elements 8, 9 and 3 that are identified by reference numerals 114, 116 and 106) converge at switch element 3 (identified by reference numeral 106). Alternate (and for purposes of claim construction, equivalent) embodiments would include using multiple RNTs for a single working path that has multiple paths that converge at a single node (switches of each path that converges might form different RNTs) as well as using multiple RNTs for a single working path.
[0050] The RNT is rooted at an appropriately chosen label switched router (“LSR”), (which hereafter is referred to as an MPLS network switch element) along the common segment of the merged working paths and is terminated at the protection switch elements (PSLs). Intermediate network switching elements on the converged working paths typically share the same RNT reducing signaling overhead associated with recovery. Unlike schemes that treat each label switched path (LSP) independently, and require signaling between a protection switch element and a destination switch individually for each LSP, the RNT allows for only one (or a small number of) signaling messages on the shared segments of the LSPs.
[0051] The RNT can be implemented either at Layer 3 or at Layer 2 of the OSI, 7-layer protocol stack. In either case, delay along the RNT needs to be carefully controlled. This may be accomplished by giving the highest priority to the fault and repair notification packets, which travel along the RNT. We can therefore have a situation where different protection domains share a common RNT.
[0052] A protection “domain” is considered to be the switches and links of both a working path and protection path. For example, in FIG. 1 , the protection domain bounded by network switch element 1 and network switch element 7, is denoted by {1-2-3-4-6-7, 1-5-7}.
[0053] When different protection domains have different RNTs, two cases may arise, depending on whether or not any portions of the two domains overlap, that is, have nodes or links in common. If the protection domains do not overlap, the protection domains are considered to be independent. By virtue of the RNTs in the two domains being different, neither of the working paths nor the RNTs of the two domains can overlap. In other words, failures in one domain do not interact with failures in the other domain. For example, the protection domain defined by {9-3-4-6-7, 9-10-7} is completely independent of the domain defined by {11-13-5-15, 11-13-14-15}. As a result, as long as faults occur in independent domains, the network shown in FIG. 1 can tolerate multiple faults (for example, simultaneous failures on the working path in each domain). If protection domains with disjoint RNTs overlap, it implies that the protection path of one intersects the working path of the other. Therefore, although failures on the working paths of the two domains do not affect one another, failures on the protection path of one may affect the working path of the other and visa versa. For example, the protection domain defined by {1-2-3-4-6-7, 1-5-7} is not independent of the domain defined by {11-13-5-15, 11-13-14-15} since LSR 5 lies on the protection path in the former domain and on the working path in the latter domain. When protection domains have the same RNT, different failures along the working paths may affect both paths differently. As shown in FIG. 1 , for example, working paths 1-2-3-4-5-7 and 9-3-4-6-7 share the same RNT. As a result, for a failure on some segments of the working path, both domains will be affected, resulting in a protection switch in both (for example, the segment 3-4-6-7 in FIG. 1 ). Likewise, for failures on other segments of the working path, only one domain may be affected (for example, failure on segment 2-3 affects only the first working path 1-2-3-4-6-7, where as failure on the segment 9-3 affects only the second working path 9-3-4-6-7).
[0054] There are a number of ways to establish a protection domain, i.e., a working path and a protection path through an MPLS network. Establishing a protection path first requires the identification of the working path (embodied as some series of switches and path links through the MPLS network from a sending node to a destination node). In most cases, the working path and its corresponding recovery path are specified during a network switch path or connection setup procedure, either via a path selection algorithm (running at a centralized location or at an ingress network switch element) or via an administrative configuration (e.g. a manual specification of switches that comprise the protection path).
[0055] The specification of either a protection or working path, does not, strictly speaking, require the entire path to be explicitly specified. Rather, it requires only that the head end node or switching node and end or destination switch or node (of the respective paths) be specified. In the absence of a destination switch/node specification, the path egress points out of the MPLS network or domain need to be specified, with the segments between them being—“loosely” determined or routed. In other words, a working path would be established between the two nodes at the boundaries of a protection domain via (possibly loose) explicit (or source) routing using LDP/RSVP [label distribution protocol/reservation protocol] signaling (alternatively, via constraint-based routing, or using manual configuration), as set forth more fully below.
[0056] FIG. 2 depicts message flows between four (4) different switches of an MPLS network that employs the path protection techniques disclosed herein. Vertical axes of FIG. 2 , identified by reference numerals 202, 204, 206 and 208, represent switching elements (shown in FIG. 1 ) of an MPLS network from which and to which various types of messages are received and sent respectively. Switch 202 is upstream from switches 204, 206 and 208. Switch 204 is upstream from switch 206 as switch 206 is upstream from switch 208.
Protection Path Establishment
[0057] A Protection Domain Path is established by the identification of a protection switch or node and an end point switch or node in the MPLS network. The protection switch element (“PSL”) initiates the setup of the working LSP and elements and the recovery LSP and elements. It is also responsible for storing information about which network switch elements or portions thereof have protection enabled, and for maintaining a binding between outgoing labels specifying the working path and the protection/recovery path. The latter enables the switchover to the recovery path upon the receipt of a protection switch trigger.
[0058] A “label distribution protocol” is a set of procedures by which one LSR (i.e., a network switch element) informs another of the label bindings it has made. “Label binding” is a process by which a message to be sent from a source to a destination is associated with various labels between the nodes that lie along the way, between the source and destination. By way of example, in FIG. 1 , a message to be sent from switch 1 to switch 7 is associated or bound to travel to switch 7 through switch 2 by, or using, the label L12 that is first associated with the message at, or by, switch 1. Switch 2 in turn associates messages labeled L12 as bound for switch 3 and re-labels them as L23. Re-labeling messages (e.g. re-labeling a message received at switch 2 on L12, as the same message that is output from switch 2 but on L23 and which is received at switch 3, to be re-labeled by switch 3 and output again as L34) is known as “label binding.” Two or more LSRs, (network switch elements) which use a label distribution protocol to exchange label binding information are known as “label distribution peers” with respect to the binding information they exchange.
[0059] The label distribution protocol also encompasses any negotiations in which two, label distribution peers, need to engage in order to learn of each other's MPLS capabilities. This label distribution protocol is referred to as path establishment signaling. MPLS defines two methods for label distribution. These two methods are: Label Distribution Protocol (LDP/CR-LDP) and ReSerVation Protocol (RSVP).
[0060] Both LDP/CR-LDP and RSVP allow a path to be setup loosely (wherein each node determines it's next hop) or explicitly (wherein each node has been given it's next hop). These two protocols can be extended, as disclosed herein and by equivalents thereof, to provide a novel mechanism by which protection path establishment can be signaled and created. Accordingly, a “Protection” field can be defined, and added as an extension to the existing label request messages in LDP/CR-LDP, and path message in RSVP protocols. The destination or end point node in the MPLS network participates in setting up a recovery path as a merging network switch element. The destination or end point node learns, during a signaling or working/protection path configuration process, which working and protection paths are merged to the same outgoing network switch element.
[0061] Hosts and routers that support both RSVP and Multi-Protocol Label Switching can associate labels with RSVP flows. When MPLS and RSVP are combined, the definition of a flow can be made more flexible. Once a label switched path (LSP) is established, the traffic through the path is defined by the label applied at the ingress node of the LSP (label switched path). The mapping of a label to traffic can be accomplished using a number of different criteria. The set of packets that are assigned the same label value by a specific node are said to belong to the same forwarding equivalence class (FEC) and effectively define the “RSVP flow.” When traffic is mapped onto a label-switched path in this way, we call the LSP an “LSP Tunnel”. When labels are associated with traffic flows, it becomes possible for a router to identify the appropriate reservation state for a packet based on the packet's label value.
[0062] A Path message travels from a sender to receiver(s) along the same path(s) used by the data packets. The IP source address of a Path message must be an address of the sender it describes, while the destination address must be the DestAddress for the session. These addresses assure that the message will be correctly routed through a non-RSVP cloud.
[0063] The format of an exemplary RSVP message with the Protection Object extension is:
<Path Message>::=<Common Header>[<INTEGRITY>]
[0064] <SESSION><RSVP_HOP>
[0065] [<TIME_VALUES>]
[0066] [<EXPLICIT_ROUTE>]
-
- [0067] [<PROTECTION>] /* The new message field. */
[0068] <LABEL_REQUEST>
[0069] [<SESSION_ATTRIBUTE>]
[0070] [<POLICY_DATA> . . . ]
[0071] <sender descriptor>
[0072] Label Distribution Protocol (LDP) is defined for distribution of labels inside one MPLS domain. One of the most important services that may be offered using MPLS in general, and LDP in particular, is support for constraint-based routing of traffic across the routed network. Constraint-based routing offers the opportunity to extend the information used to setup paths beyond what is available for the routing protocol. For instance, an LSP can be setup based on explicit route constraints, QoS constraints, and other constraints.
[0073] Constraint-based routing (CR) is a mechanism used to meet Traffic Engineering. These requirements may be met by extending LDP for support of constraint-based routed label switched paths (CR-LSPs).
[0074] The Path Vector TLV is used with the Hop Count TLV in Label Request and Label Mapping messages to implement the optional LDP loop detection mechanism. Its use in the Label Request message records the path of LSRs the request has traversed. Its use in the Label Mapping message records the path of LSRs a label advertisement has traversed to setup an LSP.
[0075] The format of an exemplary CR-LDP message with the Protection TLV extension is:
[0076]
[0077] Wherein the “Protection TLV” message field is new.
[0078] The Protection Object (RSVP)/Protection Type Length Value (TLV) (LDP/CR-LDP) establishes the working and a corresponding protection path utilizing the Reservation Protocol (RSVP) path message or the Constraint-Based Routing Label Distribution Protocol (CR-LDP) Label Request message. The attributes required to establish the Protection Domain are:
1 Priority: Specifies whether this protection group is a high or low switching priority.
2 Protection Option: Specifies whether protection is supported.
3 Protection Path Type: Specifies whether this establishment is for the Protection, or Working Path.
4 Protected Path Identifier: Specifies a unique identifier for the protection traffic.
5 Protection Node Type: Specifies whether the node is a switching, merging, or RNT root node.
6 RNT Type: Specifies whether the RNT is created using Hop-by-hop, MPLS LSP, or SONET K1/K2.
7 Timer Options: Specifies the hold off and notification time requirements.
8 Recovery Option: Specifies whether the recovery action is Wait, Switch Back, or Switchover.
9 Protection Bandwidth: Specifies whether the bandwidth of the protection path is available to carry excess (preemptable) traffic.
[0079] The following table illustrates the structure of an exemplary Protection Object/Protection TLV Structure.
[0080]
[0081] Since the switching systems used in the network 100 are unidirectional, and pathway fault recovery requires the notification of faults to a protection switch, such as switch no. 1 or switch no. 9, responsible for a switchover to a recovery path, a mechanism is provided for the fault indication and the fault recovery notification to travel from a point of occurrence of the fault back to the protection switch. The ability to propagate a fault notice upstream however is complicated when two or more data streams merge in a single switch such as the streams from switches 9 and 2 merging at switch 3. When two or more data streams merge at a switch, e.g. switch 9, a fault anywhere downstream from switch 9 will require that a fault notice be sent to multiple source switches, i.e. switches 9 and 2. The fault indication and recovery notification should be able to travel along a reverse path of the working paths to all the protection switch elements that might be affected by the fault. The path is provided by the reverse notification tree.
[0082] By way of example, FIG. 2 shows an example of an MPLS protection set up message sequence. The establishment of the working path and protection path is accomplished by the transmission of a Protection Switch Domain (PSD) initialization message 210 from a switch 202 to switches 204, 206 and 208. A PSD confirmation message 212 is propagated from the downstream switch 208 upstream to switch 202.
[0083] The reverse notification path, also referred to above as the Reverse Notification Tree or RNT, is established by the downstream switch, 208, sending an RNT initialization message 214, upstream to switches 206, 204 and 202. Confirmation of the RNT setup is accomplished by the RNT Confirmation message 216 that originates from switch 202.
[0084] Upon the establishment of the working and protection paths, and the reverse notification tree, data 218 can be sent through the network.
[0085] Two “aliveness” messages 220 and 222, which provide notification of the working path status, are shown in FIG. 2 to depict the fact that the aliveness message described above can be sent periodically, regardless of whether downstream data 218 was sent. As shown further, downstream data transmissions, such as transmissions 224, 226 and 228 are not conditioned upon receipt of an aliveness message in any fixed way. An aliveness message 230 sent upstream is then followed by yet another data transmission 232.
[0086] FIG. 2 shows that the sequence of aliveness messages and data transmissions do not need to follow any sort of predetermined or fixed order. For network reliability purposes, the aliveness messages are preferably sent periodically, so that their absence can be detected if they do not arrive on time. Alternate embodiments include sending liveness messages aperiodically.
[0087] Those skilled in the art will recognize that re-routing data on either the failure of a link or a switch in a network such as that depicted in FIG. 1 need not be performed by a protection switch. In the event that switch 4 fails for example switch no. 3 might reroute data from switch 2 that is destined for switch 7, through another protection switch element 9, identified by reference numeral 116. Switch 9 might then reroute data from switch 2 that is addressed to switch 7 over a protection path designed as P9, 10 and P10, 7 through switch 10, identified as reference numeral 118.
[0088] In the preferred embodiment, the media over which data message are carried might be twisted copper wires, coax cable, fiber optic cable or even a radio frequency data link. As set forth above, each of the switching systems might accommodate a variety of packetized data messages including but not limited to Ethernet, internet protocol, ATM, frame relay or other types of transmission switching systems.
[0089] By continuously sending an upstream message indicating that downstream traffic arrives at its destination, recovery time required to recover from the fault of a media link or a switching system can be minimized. If the switch status message used to indicate a functionality of a switch or a link is sent promptly enough, and to the appropriate node in a mesh network such as that shown in FIG. 1 , the time required to reroute data messages between first and second endpoint switches over an alternate data path can be minimized. In the preferred embodiment, the alternate or so called protection path is preferably set up in advance and maintained in a stand by mode such that it is immediately available when required by the protection switch that will reroute data over the protection path.
Claims
We claim:
1. In a data network comprised of a plurality of data switches interconnected to form a plurality of data paths forming a mesh configuration of data switches, a method of re-routing data messages between first and second data switches over a pre-established alternate data path linking said first and second data switches, the method comprising:
sending at least a first data message over a first data path from said first data switch to said second data switch;
receiving at said first data switch one or more switch status messages from said second data switch;
inhibiting generation of a switch status message at said first data switch destined for a third data switch in the first data path upon not receiving said one or more switch status messages from said second data switch at said first data switch to initiate redirection of subsequent data messages over an alternate data path through said data network.
2. The data network of claim 1 wherein said alternate data path is a protection path through said network.
3. The method of claim 1 wherein said data switches are asynchronous transfer mode switches.
4. The method of claim 1 wherein said data switches are internet protocol (IP) routers.
5. The method of claim 1 wherein said switch status messages are comprised of a predetermined format, switch liveness message.
6. The method of claim 1 wherein at least one of said data switches maintains a table of incoming link and path identifiers and of outgoing link and path identifiers.
7. The method of claim 1 wherein said first data message represents speech information.
8. The method of claim 1 wherein said first data messages represents computer data.
9. The method of claim 1 further comprising:
sending subsequent data messages to the third data switch.
10. The method of claim 1 wherein said first data switch is a protection switch element.
11. In a data network comprised of a plurality of data switches interconnected to form a plurality of data paths forming a mesh configuration of data switches, a method of re-routing data messages around a data switch comprising:
receiving at least a first data message over a first data path sent from a first data switch to a second data switch;
sending said first data message from said second data switch to a third data switch;
receiving at said second data switch one or more switch status messages indicating the functionality of said third data switch;
inhibiting generation of a switch status message destined for said first data switch at said second data switch upon not receiving said switch status messages at said second data switch from said third data switch,
wherein inhibiting generation of a switch status message destined for said first data switch at said second data switch initiates redirection of subsequent data messages away from said second and third data switches via a second data path through said data network.
12. The data network of claim 11 wherein said second data path is a protection path through said network.
13. The method of claim 11 wherein said data switches are asynchronous transfer mode switches.
14. The method of claim 11 wherein said data switches are internet protocol (IP) routers.
15. The method of claim 11 wherein said data switches are digital cross connect switches controlled by MPLS.
16. The method of claim 11 wherein said data switches are optical cross connects and switches controlled by MPLS.
17. The method of claim 11 wherein said switch status messages are comprised of a predetermined format, switch liveness message.
18. The method of claim 11 wherein at least one of said data switches maintains a table of incoming link and path identifiers and of outgoing link and path identifiers.
19. The method of claim 11 wherein said data messages represent speech information.
20. The method of claim 11 wherein said data messages represent computer data.
21. The method of claim 11 further comprising:
sending subsequent data messages to a fourth data switch.
22. In a data network comprised of a plurality of data switches interconnected to form a plurality of data paths forming a mesh configuration of data switches, a method of re-routing data messages between first and second data switches over a pre-established alternate data path linking said first and second data switches, the method comprising:
sending at least a first data message over a first data path from said first data switch to said second data switch;
sending a switch status message to said first data switch in response to not receiving said first data message from said first data switch, said switch status message operable to initiate redirection of subsequent data messages over an alternate data path through said data network.
23. In a data network comprised of a plurality of data switches interconnected to form a plurality of data paths forming a mesh configuration of data switches, a method of re-routing data messages around a data switch comprising:
sending at least a first data message over a first data path from a first data switch to a second data switch;
sending said at least a first data message from said second data switch to a third data switch;
sending a switch status message to at least one of said first and second data switches from at least one of said second and third data switches respectively in response to not receiving said first data message, said switch status message initiating redirection of subsequent data messages away from said second and third data switches via another data path through said data network.
24. The method of claim 23 wherein said first data switch is a protection switch element.
Patent Citations (35)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4706080(A) | 1987-11-01 | Sincoskie | Applicant |
| US5138615(A) | 1992-08-01 | Lamport et al. | Examiner |
| US5241534(A) | 1993-08-01 | Omuro et al. | Applicant |
| US5245616(A) | 1993-09-01 | Olson | Examiner |
| US5327427(A) | 1994-07-01 | Sandesara | Applicant |
| US5436886(A) | 1995-07-01 | McGill | Examiner |
| US5450578(A) | 1995-09-01 | Mackenthun | Applicant |
| US5771227(A) | 1998-06-01 | Benayoun et al. | Applicant |
| US5838924(A) | 1998-11-01 | Anderson et al. | Applicant |
| US5930259(A) | 1999-07-01 | Katsube et al. | Applicant |
| US5933412(A) | 1999-08-01 | Choudhury et al. | Applicant |
| US5991300(A) | 1999-11-01 | Tappan | Applicant |
| US6034961(A) | 2000-03-01 | Masuo et al. | Applicant |
| US6055561(A) | 2000-04-01 | Feldman et al. | Applicant |
| US6065061(A) | 2000-05-01 | Blahut et al. | Applicant |
| US6111858(A) | 2000-08-01 | Greaves et al. | Examiner |
| US6167025(A) | 2000-12-01 | Hsing et al. | Examiner |
| US6215765(B1) | 2001-04-01 | McAllister et al. | Examiner |
| US6226260(B1) | 2001-05-01 | McDysan | Examiner |
| US6339595(B1) | 2002-01-01 | Rekhter et al. | Applicant |
| US6452942(B1) | 2002-09-01 | Lemieux | Applicant |
| US6463062(B1) | 2002-10-01 | Buyukkoc et al. | Applicant |
| US6504963(B1) | 2003-01-01 | Fang et al. | Applicant |
| US6530032(B1) | 2003-03-01 | Shew et al. | Examiner |
| US6532088(B1) | 2003-03-01 | Dantu et al. | Applicant |
| US6535481(B1) | 2003-03-01 | Andersson et al. | Applicant |
| US6538987(B1) | 2003-03-01 | Cedrone et al. | Examiner |
| US6590893(B1) | 2003-07-01 | Hwang et al. | Applicant |
| US6594268(B1) | 2003-07-01 | Aukia et al. | Applicant |
| US6647208(B1) | 2003-11-01 | Kirby | Applicant |
| US6680943(B1) | 2004-01-01 | Gibson et al. | Applicant |
| US6697329(B1) | 2004-02-01 | McAllister et al. | Applicant |
| US6813242(B1) | 2004-11-01 | Haskin et al. | Applicant |
| US6879594(B1) | 2005-04-01 | Lee et al. | Applicant |
| US2002/0181485(A1) | 2002-12-01 | Cao et al. | Applicant |
Non-Patent Literature (23)
- Arun Viswanathan, et al., “Evolution of Multiprotocol Label Switching,” IEEE Communications Magazine, May 1998.Applicant
- Francois Le Faucheur, “IETF Multiprotocol Label Switching (MPLS) Architecture,” Cisco Systems, France.Applicant
- Tom Downey, “Over view of Tag Switching” Cisco Systems, Inc., Chemsford, MA; 0-7803-3987-8/97.Applicant
- Downey, “Overview of Tag Switching”, IEEE, 1997, pp. 61-66.Applicant
- Haskin, et al. “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute”,http://toos.ietf.org/html/draft-haskin-mpls-fast-reroute-00.txt, Jun. 1999, 10 pages.Applicant
- Haskin, et al. “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute”,http://toos.ietf.org/html/draft-haskin-mpls-fast-reroute-01.txt, Jun. 1999, 9 pages.Applicant
- Haskin, et al. “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute”,http://toos.ietf.org/html/draft-haskin-mpls-fast-reroute-02.txt, Dec. 1999, 5 pages.Applicant
- Haskin, et al. “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute”,http://toos.ietf.org/html/draft-haskin-mpls-fast-reroute-03.txt, Mar. 2000, 7 pages.Applicant
- Haskin, et al. “A Method for Setting an Alternative Label Switched Paths to Handle Fast Reroute”,http://toos.ietf.org/html/draft-haskin-mpls-fast-reroute-04.txt, May 2000, 7 pages.Applicant
- Rosen et al., “Multiprotocol Label Switching Architecture” draft-ietf-mpls-arch-06.txt, http://www3.ietf.org/proceedings/99nov/I-D/draft-ietf-mpls-arch-06.txt, Aug. 1999, 49 pages.Applicant
- Callon, et al., “A Framework for Multiprotocol Label Switching” <draft-ietf-mpls-framework-05.txt>, http://www3.ietf.org/proceedings/99nov/I-D/draft-ietf-mpls-framework-05.txt, Sep. 1999, 64 pages.Applicant
- Awduche, et al., “Requirements for Traddic Engineering Over MPLS”, http://delivery.acm.org/10.1145/rfc—fulltext/RFC2702/rfc2702.txt?key1=RFC2702&key2?0334318711&c..., Sep. 1999, 26 pages.Applicant
- Anderson, et al., “LDP Sepcification” draft-ietf-mpls-ldp-06.txt, http://www3.ietf.org/proceedings/99nov/I-D/draft-ietf-mpls-ldp-06.txt, Oct. 1999, 95 pages.Applicant
- Jamoussi, Bilel, “Constraint-Based LSP Setup Using LDP” draft-ietf-mpls-cr-ldp-03.txt, http://www3.ietf.org/proceedings/99nov/I-D/draft-ietf-mpls-cr-ldp-03.txt, Sep. 1999, 34 pages.Applicant
- Braden, et al., RFC 2205 (RFC2205), “RFC 2205 - Resource ReSerVation Protocol (RSVP) -- Version 1 Functional Specification” http://www.faqs.org/rfcs/rfc2205.html, Sep. 1997, 74 pages.Applicant
- Awuche, et al., “Extensions to RSVP for LSP Tunnels” draft-ietf-mpls-rsvp-lsp-tunnel-04.txt, http://www3.ietf.org/proceedings/99nov/I-D/draft-ietf-mpls-rsvp-lsp-tunnel-04.txt, Sep. 1999, 37 pages.Applicant
- Owens, et al., “Network Survivability Considerations for Traffic Engineered IP Networks”, draft-owens-te-network-survivability-01..txt, http://www3.ietf.org/proceedings/02mar/I-D/draft-owens-te-network-survivability-01..txt, Jul. 2001, 15 pages.Applicant
- Sharma, et al., “Framework for MPLS-based Recovery” <draft-ietf-mpls-recovery-frmwrk-00.txt>, http://tools.ietf.org/html/draft-ietf-mpls-reocvery-frmwrk-00.txt, Sep. 2000, 30 pages.Applicant
- Huang, et al., “A Path Protection/Restoration Mechanism for MPLS Networks”, <draft-chang-mpls-path-protection-00.txt., http://tools.ietf.org/html/draft-chang-mpls-path-protection-00, Mar. 2000 15 pages.Applicant
- Huang, et al., “Extensions to RSVP-TE for MPLS Path Protection”, <draft-chang-mpls-rsvpte-path-protection-ext-00.txt., http://tools.ietf.org/html/draft-chang-mpls-rsvpte-path-protection-ext-00.txt., Jun. 2000, 10 pages.Applicant
- “Synchronous Optical Network (SONET) Transport Systems: Common Generic Criteria”, Document No. GR-253, Issue Number 04; Issue Date Dec. 2005, http://telecom-info.telcordia.com/site-cgi/ido/docs2.pl?ID=idosearch&docnum=GR-253, 20 pages.Applicant
- “SONET Dual-Fed Unidirectional Path Switched Ring (UPSR) Equipment Generic Criteria”, GR-1400-CORE, Issue 2, Jan. 1999, SONET UPSR Equipment Generic Criteria Contents, 5 pages.Applicant
- “SONET Bidirectional Line-Switched Ring Equipment Generic Criteria”, GR-1230-CORE, Issue 4, Dec. 1998, SONET BLSR Equipment Generic Criteria Contents, 7 pages.Applicant