EP1861939A2 - Method and system for providing qos during network failure - Google Patents

Method and system for providing qos during network failure

Info

Publication number
EP1861939A2
EP1861939A2 EP06736179A EP06736179A EP1861939A2 EP 1861939 A2 EP1861939 A2 EP 1861939A2 EP 06736179 A EP06736179 A EP 06736179A EP 06736179 A EP06736179 A EP 06736179A EP 1861939 A2 EP1861939 A2 EP 1861939A2
Authority
EP
European Patent Office
Prior art keywords
packets
rerouted
failure
tunnel
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP06736179A
Other languages
German (de)
French (fr)
Other versions
EP1861939A4 (en
EP1861939B1 (en
Inventor
François LE FAUCHEUR
John Evans
Alton Lo
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Cisco Technology Inc
Original Assignee
Cisco Technology Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Cisco Technology Inc filed Critical Cisco Technology Inc
Publication of EP1861939A2 publication Critical patent/EP1861939A2/en
Publication of EP1861939A4 publication Critical patent/EP1861939A4/en
Application granted granted Critical
Publication of EP1861939B1 publication Critical patent/EP1861939B1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • H04L45/3065—Route determination based on the nature of the carried application for real time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/11—Identifying congestion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2458—Modification of priorities while in transit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/29—Flow control; Congestion control using a combination of thresholds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/31—Flow control; Congestion control by tagging of packets, e.g. using discard eligibility [DE] bits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/726—Reserving resources in multiple paths to be used simultaneously
    • H04L47/728—Reserving resources in multiple paths to be used simultaneously for backup paths
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
    • H04L47/746—Reaction triggered by a failure
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/801—Real time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/825—Involving tunnels, e.g. MPLS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation

Definitions

  • the present invention relates generally to data networking, and more particularly, to ensuring QoS (Quality of Service) of voice or mission critical traffic during network failure.
  • QoS Quality of Service
  • the Internet and IP networks in general have become enablers for a broad range of business, government, and personal activities. More and more, the Internet is being relied upon as a general information source, business communication tool, entertainment source, and as a substitute for traditional telephone networks and broadcast media. As the Internet expands its role, users become more dependent on uninterrupted access.
  • IGP may reroute traffic affected by the failure, before a new admission control decision has been taken. Thus, congestion may occur in this transient period before CAC is performed and some calls are potentially torn down.
  • Bandwidth Protection attempts to minimize the amount of capacity allocated to FRR backup tunnels by including smart optimizations, such as sharing backup capacity for protection of different failures which are unlikely to happen at the same time.
  • this approach still requires that there is enough capacity to support all traffic after the failure, otherwise all traffic flow can get degraded.
  • Bandwidth Protection also cannot cope with unplanned combinations of failures.
  • a network operator is therefore left with two options to deal with network failures. The first is to allocate a large amount of capacity to make sure QoS of all the targeted traffic can be maintained during any failure scenario. The second is to accept that any flow from the targeted traffic may be degraded during a failure. Both of these options have drawbacks.
  • Fig. 1 depicts an example of a network architecture to which embodiments of the present invention may be applied.
  • Fig. 2 depicts a network device useful in implementing embodiments of the present invention.
  • Fig. 2 depicts a network device 20 that may be used to implement any of the network elements of Fig. 1.
  • network device 20 is a programmable machine that may be implemented in hardware, software, or any combination thereof.
  • a processor 22 executes codes stored in a program memory 24.
  • Program memory 24 is one example of a computer-readable medium.
  • Program memory 24 can be a volatile memory.
  • Another form of computer-readable medium storing the same codes would be some type of non- volatile storage such as floppy disks, CD-ROMs, DVD-ROMs 5 hard disks, flash memory, etc.
  • a carrier wave that carries the code across the network is another example of a computer-readable medium.
  • backup tunnels are pre-calculated and configured to provide a path around a protected element (link or node). Traffic flowing through a failed link or node is rerouted through one or more preconfigured backup tunnels. When an element such as a link or node fails, all of the LSPs using that failed element are redirected through preconfigured backup tunnels that route around the impacted segments. When the failure is detected, any primary TE tunnels which were traversing the failed element are rapidly switched locally by the router interfacing the failed link or node onto the pre-calculated backup tunnels. The head-end of the primary tunnel is also notified of the link failure through IGP or through RSVP. The head-end then attempts to re-establish the tunnel along a potentially more optimal route that bypasses the failure.
  • packets switched from primary tunnel TEl to backup tunnel BT following a failure in TEl are marked to identify the packets as demoted packets and distinguish the packets from those not affected by the failure (e.g., packets on TE2).
  • Both the regular voice traffic (traffic on primary tunnel TE2) and the rerouted voice traffic (traffic on backup tunnel BT) are scheduled, for example, in an EF (Expedited Forwarding) queue. If the network has enough capacity for all of the traffic, no voice QoS degradation occurs. If there is no congestion, the system protects traffic (e.g., does not drop traffic).
  • the rerouted packets are handled like the packets not affected by the failure and transmitted in the same manner.
  • RSVP may be used to provide application level CAC feedback, rather than a bandwidth manager.
  • RSVP may be used with partial bandwidth protection.
  • the network may be configured such that an operator can control whether bandwidth protection is provided during Fast Reroute.
  • the EXP field is marked for the traffic passing through the backup tunnel.
  • the backup tunnel is configured on router 76b to enable TE demotion and mark the reroute traffic MPLS EXP to 4.
  • the non-rerouted traffic retains its MPLS EXP marking of 5.
  • Methods for identifying the demoted traffic include an EXP-based pushed only approach (where only the EXP of the pushed label stack entry is demoted) or an EXP- based pushed and swapped approach (where both the EXP of the pushed label stack entry and the swapped label stack entry are demoted).
  • EXP-based pushed only approach where only the EXP of the pushed label stack entry is demoted
  • EXP- based pushed and swapped approach where both the EXP of the pushed label stack entry and the swapped label stack entry are demoted.
  • POP Penultimate Hop Popping
  • Flexible demotion mapping may also be used.
  • HMMP may be used to police separately the demoted voice and the regular (nondemoted) voice traffic.
  • the policing rate for the demoted voice traffic is the difference between a configured maximum acceptable rate for the EF queue and the rate currently consumed by regular voice traffic.
  • Token buckets may be used for demoted voice (Td) and regular voice (Tr).
  • Tr and Td are both filled at the same rate (R).
  • Td is checked before transmitting a demoted voice packet. If there are not enough available tokens, the packet is dropped. If there are available tokens, Td is decremented and the packet is transmitted. Tr is checked before transmitting a regular voice packet. If there are not enough tokens, the packet is dropped.
  • Queue-based approaches include, for example, Multi-Level Expedited Forwarding (MLFF), described in "Multi-Level Expedited Forwarding Per Hop

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Abstract

A method and system for providing QoS in a network after a network failure are disclosed. The network includes at least one primary tunnel and at least one backup tunnel protecting a segment of the primary tunnel. The method includes receiving notification of a failure within the primary tunnel segment and rerouting received packets onto the backup tunnel. The rerouted packets are marked to identify packets affected by the failure and are subject to a different QoS policy than packets that have not been rerouted due to the failure.

Description

METHOD AND SYSTEM FOR PROVIDING QoS DURING NETWORK FAILURE
BACKGROUND OF THE INVENTION The present invention relates generally to data networking, and more particularly, to ensuring QoS (Quality of Service) of voice or mission critical traffic during network failure.
The Internet and IP networks in general have become enablers for a broad range of business, government, and personal activities. More and more, the Internet is being relied upon as a general information source, business communication tool, entertainment source, and as a substitute for traditional telephone networks and broadcast media. As the Internet expands its role, users become more dependent on uninterrupted access.
To assure rapid recovery in the event of failure of a network link or node, Fast Reroute (FRR) techniques have been developed. In a network employing Fast Reroute, traffic flowing through a failed link or node is rerouted through one or more preconfigured backup tunnels. The preconfigured backup tunnels facilitate a key goal of Fast Reroute techniques, the redirection of interrupted traffic within tens of milliseconds. This minimizes impact on the user experience. The Fast Reroute techniques have been developed in the context of MPLS (Multiprotocol Label
Switching) where traffic flows through label switched paths (LSPs). When an element such as a link or node fails, all of the LSPs using that failed element are redirected through preconfigured backup tunnels that route around the impacted segments of the LSPs. Providing strict QoS to voice during network failure still remains an open problem in large scale voice deployment where the proportion of voice traffic is high. Multiservice networks, such as those carrying telephony traffic, require very tight QoS as well as very fast recovery in case of network failure. A number of techniques, including Diffserv (Differentiated Services), MPLS Traffic Engineering, capacity planning, and RSVP (ReSerVation Protocol) based CAC (call admission control) are available to provide very tight QoS in the absence of failure. However, none of these voice load control approaches perform very well during a network failure. For example, when only capacity planning is used to ensure voice QoS, enough spare capacity needs to be provisioned to ensure that there is no congestion in failure cases. While many networks provision to allow for single element failures, there still may be congestion if multiple failures occur concurrently (or in the case of unexpected traffic load or traffic distribution) unless gross overprovisioning is used.
With RSVP based CAC approaches, in the time interval immediately following network failures, IGP may reroute traffic affected by the failure, before a new admission control decision has been taken. Thus, congestion may occur in this transient period before CAC is performed and some calls are potentially torn down.
A number of techniques, such as MPLS/IP Fast Reroute discussed above, are available to provide very fast recovery in case of failure. However, there are only limited techniques available for protecting QoS over the period during which fast recovery mechanisms are in use. For example, with MPLS Fast Reroute, unless Bandwidth Protection mechanisms are used there may be congestion, which will last until an alternate path is found. If no alternate path is found, the congestion will last indefinitely. Bandwidth Protection builds on the use of MPLS Fast Reroute by allocating bandwidth to backup tunnels. Bandwidth Protection thus requires a very significant amount of bandwidth to be dedicated to backup to protect all voice traffic in all targeted failure scenarios. Bandwidth Protection attempts to minimize the amount of capacity allocated to FRR backup tunnels by including smart optimizations, such as sharing backup capacity for protection of different failures which are unlikely to happen at the same time. However, this approach still requires that there is enough capacity to support all traffic after the failure, otherwise all traffic flow can get degraded. Bandwidth Protection also cannot cope with unplanned combinations of failures. A network operator is therefore left with two options to deal with network failures. The first is to allocate a large amount of capacity to make sure QoS of all the targeted traffic can be maintained during any failure scenario. The second is to accept that any flow from the targeted traffic may be degraded during a failure. Both of these options have drawbacks. For example, the first option is very expensive, and the second results in a possible degradation in QoS for all the traffic flow. There is, therefore, a need for a method and system for mitigating QoS degradation during network failure in different environments. SUMMARY OF THE INVENTION
Embodiments of the present invention provide a method and system for protecting QoS in a network after a network failure occurs. In one embodiment, the network includes at least one primary tunnel and at least one backup tunnel protecting a segment of the primary tunnel. A method includes receiving notification of a failure within the primary tunnel segment and rerouting received packets onto the backup tunnel. The rerouted packets are marked to identify packets affected by the failure so that a separate policy is applied to the rerouted packets. This policy is such that if there is no congestion after the failure, then all the rerouted packets are transmitted the same as non-rerouted packets. However, if congestion occurs following the failure, then some of the rerouted packets are dropped in order to ensure that non-rerouted packets are not dropped and can retain their QoS.
In another aspect of the invention, a method generally comprises creating a primary tunnel, establishing a backup tunnel protecting a segment of the primary tunnel, activating the backup tunnel in response to failure of the primary tunnel segment, and forwarding packets assigned to the primary tunnel via the backup tunnel. The method further comprises identifying packets affected by the failure as demoted packets and applying a separate policy to the demoted packets. If no congestion is present, the rerouted packets are transmitted in the same manner as the non-rerouted packets. If congestion occurs at least a portion of the demoted packets are dropped, while protecting the packets not affected by the failure.
In yet another aspect of the invention, a system for identifying packets rerouted following a failure in a network generally comprises a network element located in a path of a primary tunnel in the network and a backup tunnel protecting a segment of the primary tunnel. The network element is operable to receive notification of a failure within the primary tunnel and route packets received from the primary tunnel to the backup tunnel. The network element comprises a demotion apparatus configured to mark the rerouted packets to identify packets affected by the failure as demoted packets such that a differentiated QoS policy can be applied to the demoted packets. Further understanding of the nature and advantages of the inventions herein may be realized by reference to the remaining portions of the specification and the attached drawings. BRIEF DESCRIPTION OF THE DRAWINGS
Fig. 1 depicts an example of a network architecture to which embodiments of the present invention may be applied.
Fig. 2 depicts a network device useful in implementing embodiments of the present invention.
Fig. 3 is a diagram illustrating one embodiment of a Fast Reroute demotion mechanism of the present invention for marking rerouted traffic.
Fig. 4 is a flowchart illustrating a Fast Reroute demotion process of the present invention.
DESCRIPTION OF SPECIFIC EMBODIMENTS
The following description is presented to enable one of ordinary skill in the art to make and use the invention. Descriptions of specific embodiments and applications are provided only as examples and various modifications will be readily apparent to those skilled in the art. The general principles described herein may be applied to other embodiments and applications without departing from the scope of the invention. Thus, the present invention is not to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features described herein. For purpose of clarity, details relating to technical material that is known in the technical fields related to the invention have not been described in detail.
A method and system of the present invention (referred to herein as Fast Reroute (FRR) Demotion) protect QoS to voice (or other targeted traffic) during network failures by mitigating QoS degradation during network failures. Dynamic routing mechanisms such as Fast Reroute, attempt to route all traffic after a network failure to a new path. In the case of topology change (and in particular in the case of a link or node failure), all traffic affected by the topology change gets rerouted to its new path. The method and system of the present invention keep track of a subset of traffic that was affected by the network failure, after the rerouting takes place, and use this information to enforce differentiated QoS policies. If there is no congestion after a network failure, there is no degradation of traffic. However, if there is congestion after the failure, only the subset of traffic, which is affected by the failure, is degraded while the rest of the traffic is protected.
In one embodiment, the Fast Reroute Demotion extends the FRR policy such that fast rerouted traffic can be demoted so that it can subsequently be identified as rerouted traffic and preferentially discarded. QoS mechanisms are used to reflect the identification and enforce a QoS policy so that the non-rerouted traffic gets priority over the rerouted traffic. The QoS mechanism is tied together with Fast Reroute state information and forwarding state information maintained by a Fast Reroute mechanism is used to selectively mark traffic which is currently fast rerouted. The selective marking is then used to apply differentiated treatment to the that traffic, as described below.
Referring now to the drawings, and first to Fig. 1, one example of a network that may implement Fast Reroute Demotion is shown. The present invention operates in the context of a data communication network including multiple network elements. Some of the elements in a network that employs the present invention may be network devices such as routers or switches. For example, some of the nodes may be specially configured routers such as those available from Cisco Systems, Inc. of San Jose, California. The router may include, for example, a master central processing unit (CPU), interfaces, and a bus. The CPU preferably includes memory and a processor. A router may be implemented on a general purpose network host machine such as a computer system or network device described below with respect to Fig. 2.
Fig. 2 depicts a network device 20 that may be used to implement any of the network elements of Fig. 1. In one embodiment, network device 20 is a programmable machine that may be implemented in hardware, software, or any combination thereof. A processor 22 executes codes stored in a program memory 24. Program memory 24 is one example of a computer-readable medium. Program memory 24 can be a volatile memory. Another form of computer-readable medium storing the same codes would be some type of non- volatile storage such as floppy disks, CD-ROMs, DVD-ROMs5 hard disks, flash memory, etc. A carrier wave that carries the code across the network is another example of a computer-readable medium.
Network device 20 interfaces with physical media via a plurality of linecards 26. Any number of linecards 26 may be used and each linecard may include numerous separate physical interfaces. Linecards 26 may incorporate DSL interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, 10-Gigabit Ethernet interfaces, Frame relay interfaces, ATM interfaces, SONET interfaces, dial-up interfaces, wireless interfaces, etc. The various components are interconnected by a backplane. As packets are received, processed, and forwarded by network device 20, they may be stored in a packet memory 28. The present invention is described herein with reference to a representative application but is not limited to this application. In the representative application, calls such as voice or video calls are carried across a packet network such as an IP network. The network devices operate in accordance with various protocols including, for example, TCP/IP, MPLS, MPLS Traffic Engineering, and MPLS Fast Reroute. In one implementation, when a packet is received by a linecard 26, the linecard determines the output linecard and interface and forwards the packet. Prior to transfer of the packet, the receiving linecard 26 encapsulates the packet with any needed layer 2 addressing information for forwarding to the next hop node and the label or labels required by operation of the MPLS and/or MPLS Fast Reroute protocols. The routing processor sets up label switched paths (LSPs) and backup tunnels by appropriately modifying forwarding information on the linecards. The primary LSPs may support, for example, Traffic Engineering (TE) tunnels, layer 2 or layer 3 virtual private networks, pseudowire emulated circuits, virtual private LAN service, etc. Referring again to Fig. 1, packets are originated or terminated by various user agents which are devices such as telephones, video phones, computers, etc. (not shown) coupled to routers 30. Data traffic flows through various routers 30 and edge router 32 into a network cloud 34 that includes further routers 58, 60, 62, 64, 66, 68, 70, 72. On the other side of the cloud there is another edge router 36 and other routers 38 and user agents (not shown). In the example shown in Fig. 1, the access routers 32, 36 are in communication with gateways 40, 42, which in turn communicate with public switched telephone networks (PSTNs) 44, 46, respectively. SS7 (Signaling System Number 7) 50 sources out-of-band signaling throughout the PSTNs 44, 46. The network also includes a call agent 52 and bandwidth manager 54. Voice traffic is carried over MPLS TE tunnels. The bandwidth manager 54 provides CAC of voice calls over primary tunnels. In the example shown, a primary TE tunnel (TEl) extends from edge router 32 through network elements 58 and 60 to edge router 36. Another tunnel (TE2) passes from edge device 66 through network elements 62, 64, and 60 to edge device 36. Network device 32 notifies the bandwidth manager 54 of the tunnel status and the bandwidth manger applies CAC of calls over the TE tunnels.
Prior to failure, the voice load on the network is controlled to ensure strict QoS voice traffic using conventional voice load control techniques (e.g., capacity planning, Bandwidth Manager CAC, RSVP-based CAC, or other suitable techniques). In one embodiment, the network may use CAC and CSPF (Constraint Shortest Path Fast) of TE tunnel over core network to provide strict QoS in the absence of network failure. Following a failure, dynamic rerouting takes place to restore the connectivity. The rerouting may be performed using any number of techniques, including, for example, regular IGP rerouting, Fast IGP rerouting, MPLS Fast Reroute, or any other suitable technique. With MPLS TE FRR, backup tunnels are pre-calculated and configured to provide a path around a protected element (link or node). Traffic flowing through a failed link or node is rerouted through one or more preconfigured backup tunnels. When an element such as a link or node fails, all of the LSPs using that failed element are redirected through preconfigured backup tunnels that route around the impacted segments. When the failure is detected, any primary TE tunnels which were traversing the failed element are rapidly switched locally by the router interfacing the failed link or node onto the pre-calculated backup tunnels. The head-end of the primary tunnel is also notified of the link failure through IGP or through RSVP. The head-end then attempts to re-establish the tunnel along a potentially more optimal route that bypasses the failure.
In the example shown in Fig. 1, if a failure occurs along the tunnel TEl at a link between devices 58 and 60, an FRR backup tunnel (BT) is provided which extends between devices 58 and 60. Regardless of the approach used for Voice Load Control (e.g., Bandwidth Manager, RSVP-based CAC, etc.) there is a period of time needed by the Voice Load Control mechanisms to adjust to the new routing state. During this transient period, some voice traffic is rerouted on the remaining links. This may result in congestion in the voice queue and degrade the QoS of all voice calls on the link. As described below, an FRR demotion mechanism is used to mark voice packets which go in the backup tunnel and a differential dropping mechanism is activated. For example, in the network shown in Fig. 1, packets switched from primary tunnel TEl to backup tunnel BT following a failure in TEl are marked to identify the packets as demoted packets and distinguish the packets from those not affected by the failure (e.g., packets on TE2). Both the regular voice traffic (traffic on primary tunnel TE2) and the rerouted voice traffic (traffic on backup tunnel BT) are scheduled, for example, in an EF (Expedited Forwarding) queue. If the network has enough capacity for all of the traffic, no voice QoS degradation occurs. If there is no congestion, the system protects traffic (e.g., does not drop traffic). The rerouted packets are handled like the packets not affected by the failure and transmitted in the same manner. However, if not enough capacity is available, voice QoS degradation is localized to the subset of demoted voice packets. If there is congestion, then the necessary amount of demoted traffic is dropped to protect the QoS of the non-rerouted voice traffic. The system protects the calls which were not transiting via the failed element by dropping only rerouted traffic.
These calls will either not have been admitted on the rerouted path or will already have experienced some loss as a result of being rerouted. The system thus minimizes the number of calls affected by dropping some or all of the packets from a smaller subset of calls, rather than dropping randomly across all calls. It is to be understood that the network shown in Fig. 1 and described above is only one example, and other network configurations and voice load control architectures may be used without departing from the scope of the invention. For example, RSVP may be used to provide application level CAC feedback, rather than a bandwidth manager. In another embodiment, RSVP may be used with partial bandwidth protection. Also, the network may be configured such that an operator can control whether bandwidth protection is provided during Fast Reroute.
Fig. 3 illustrates one example for marking demoted traffic. The experimental field (EXP) in an MPLS label in the backup tunnel stack entry is remarked to a configurable value. Primary TE tunnel 74 extends between router 76a and 76d, passing through routers 76b and 76c. A backup tunnel 78 extends between routers 76b and 76c and passes through router 76e. The backup tunnel can be identified as such by the control plane through explicit notification in tunnel establishment signaling or may have been signaled as an L-LSP, as described in IETF RFC 3270, "Multi-Protocol Label Switched (MPLS) Support of Differentiated Services", Le Faucheur et al., May 2002, which is incorporated herein by reference in its entirety. As shown in Fig. 3, the EXP field is marked for the traffic passing through the backup tunnel. The backup tunnel is configured on router 76b to enable TE demotion and mark the reroute traffic MPLS EXP to 4. The non-rerouted traffic retains its MPLS EXP marking of 5.
Methods for identifying the demoted traffic include an EXP-based pushed only approach (where only the EXP of the pushed label stack entry is demoted) or an EXP- based pushed and swapped approach (where both the EXP of the pushed label stack entry and the swapped label stack entry are demoted). With the former approach, if Penultimate Hop Popping (PHP) is used, the penultimate router of the backup tunnel does classification based on EXP before label POP. Flexible demotion mapping may also be used.
As discussed above, the Fast Reroute mechanism is used to identify the traffic that is demoted. Some granularity may be available as to which rerouted traffic should be demoted during Fast Reroute. For example, demotion may be applied only to Voice tunnels, which can be identified via their bandwidth pools (DS-TE Class-Type signaled in RSVP-TE).
The MPLS FRR demotion capability may also be applied at primary tunnel head-ends so that if there is a failure of the primary tunnel, due to a CAC failure, for example, tunnel traffic which is rerouted onto the IGP shortest path is similarly demoted such that it can be subsequently identified as rerouted traffic and hence preferentially discarded.
Fig. 4 is a flowchart illustrating one example of a method of the present invention for identifying traffic affected by a topology change after traffic is rerouted to a backup tunnel following a network failure. At step 80 primary TE tunnels are established in a core network. TE FRR backup tunnels are pre-calculated and configured to provide a path around protected elements (step 82). Voice traffic is carried over the MPLS TE tunnels and voice load control is applied to provide strict QoS in the absence of failure. At step 84, a failure is detected and traffic on the affected TE tunnel is switched to the backup tunnel. The traffic that is rerouted to the backup tunnel is marked using the FRR demotion mechanism (step 86). If there is no congestion after the failure, no traffic is degraded (steps 88 and 90). If congestion is present, a necessary amount of demoted traffic is dropped to protect the QoS of the regular voice traffic (steps 88 and 92). As discussed above, if voice congestion is present, a necessary amount of demoted traffic is dropped to protect the QoS of voice traffic not affected by the failure. Voice traffic which has been rerouted and is temporarily not protected by CAC of its primary tunnel is identified. Queue-less or queue-based approaches may be used to ensure that the necessary amount of demoted traffic is dropped if congestion occurs. Queueless rate control techniques may include, for example, HMMP
(Hierarchical Multi-rate Multi-precedence Policer), as described in U.S. Patent Application Serial No. 11/019,915 (Francois Le Faucheur et al., filed December 21, 2004), or Coupled Policers, described in U.S. Patent Application Serial No. 10/607,711 (Prashant Gandhi et al., filed June 27, 2003), which are both incorporated by reference herein in their entirety.
For example, HMMP may be used to police separately the demoted voice and the regular (nondemoted) voice traffic. The policing rate for the demoted voice traffic is the difference between a configured maximum acceptable rate for the EF queue and the rate currently consumed by regular voice traffic. Token buckets may be used for demoted voice (Td) and regular voice (Tr). In one embodiment, Tr and Td are both filled at the same rate (R). Td is checked before transmitting a demoted voice packet. If there are not enough available tokens, the packet is dropped. If there are available tokens, Td is decremented and the packet is transmitted. Tr is checked before transmitting a regular voice packet. If there are not enough tokens, the packet is dropped. If enough tokens are available, Tr is decremented and the packet is transmitted. Whenever Tr is decremented, Td is also decremented by the same amount. In another example, Coupled Policers may be used to control how bandwidth left unused by regular voice traffic is redistributed to demoted traffic. As described above with regard to HMMP, a token bucket Td is used for demoted voice packets and Tr for regular voice packets. For demoted voice packets, if Td does not have enough tokens, the demoted voice packet is dropped. IfTd has available tokens, Td is decremented and the packet is transmitted. For regular voice packets, if Tr does not have enough tokens, the packet is dropped. IfTr has available tokens, Tr is decremented and the packet is transmitted. In this example, Tr is filled at rate R and Td is only filled up by tokens overflowing from Tr. Whenever Tr gets filled up (i.e., reaches its maximum burst), any excess token goes into Td.
Queue-based approaches include, for example, Multi-Level Expedited Forwarding (MLFF), described in "Multi-Level Expedited Forwarding Per Hop
Behavior (MLEF PHB)", draft-silverman-tsvwg-mlefphb-02.txt, February 12, 2005, which is incorporated herein by reference in its entirety. MLEF may be used, for example, to apply different drop thresholds within the EF queue to detect a congestion situation and drop the demoted traffic. Another queue-based approach includes separate or hierarchical scheduling of the demoted voice traffic and regular voice traffic.
It is to be understood that the methods described above for use in handling the demoted traffic in the case of congestion are only examples, and that other methods may be used without departing from the scope of the invention. For example, the FRR

Claims

CLAIMSWHAT IS CLAIMED IS:
1. A method for providing QoS in a network after a network failure, the network comprising at least one primary tunnel and at least one backup tunnel protecting a segment of said primary tunnel, the method comprising: receiving notification of a failure within said primary tunnel segment; rerouting received packets onto the backup tunnel; and marking said rerouted packets to identify packets affected by the failure; whereby said rerouted packets are subject to a different QoS policy than packets that have not been rerouted due to the failure.
2. The method of claim 1 wherein said QoS policy applied to said rerouted packets is configured such that: if there is no congestion following the failure, said rerouted packets are transmitted in the same manner as the packets that have not been rerouted; and if congestion occurs said rerouted packets have a lower priority than the packets that have not been rerouted.
3. The method of claim 1 wherein said primary and backup tunnels are MPLS tunnels.
4. The method of claim 1 wherein receiving packets comprises receiving voice packets.
5. The method of claim 1 wherein there is no QoS degradation for the non- rerouted packets whether or not congestion occurs.
6. The method of claim 1 wherein said QoS policy applied to the rerouted packets comprises dropping at least a portion of the rerouted packets if congestion occurs.
12 demotion may be used in combination with various QoS mechanisms (e.g., RED, WRED, tail-drop, separate parallel or hierarchical queue) to enforce the QoS differentiation in case of congestion.
As can be observed from the foregoing, the FRR demotion system and method described herein have many advantages. For example, FRR demotion allows operators to avoid the cost of provisioning back up capacity to protect peak load during any possible failure while at the same time avoiding QoS degradation impact on all key traffic (e.g., voice). This is important where a proportion of key traffic is high. The operator is able to provision as much capacity for backup as is appropriate and take advantage of that capacity to its full extent without any QoS loss on any traffic, if the actual load fits after reroute. Also, the majority of key traffic can be protected from QoS degradation if the actual load does not fit after reroute. The QoS degradation can be localized to the subset of traffic which is affected by failure if the actual load does not fit after reroute. Although the present invention has been described in accordance with the embodiments shown, one of ordinary skill in the art will readily recognize that there could be variations made to the embodiments without departing from the scope of the present invention. Accordingly, it is intended that all matter contained in the above description and shown in the accompanying drawings shall be interpreted as illustrative and not in a limiting sense.
11
7. The method of claim 1 wherein a policing rate for the rerouted packets is the difference between a configured maximum acceptable rate for a queue and a rate consumed by traffic not affected by the failure.
8. The method of claim 1 wherein marking said rerouted packets comprises marking an EXP field in one or more MPLS label stack entries of the packets.
9. A method for providing QoS in a network after a network failure, the method comprising: creating a primary tunnel; establishing a backup tunnel protecting a segment of said primary tunnel; forwarding packets assigned to said primary tunnel via said backup tunnel in response to failure of said primary tunnel segment; identifying packets affected by the failure as demoted packets; and applying to said demoted packets a different QoS policy than applied to packets that have not been rerouted due to the failure.
10. The method of claim 9 wherein said QoS policy applied to said demoted packets is configured such that: if there is no congestion following the failure, said demoted packets are transmitted in the same manner as the packets that have not been rerouted; and if congestion occurs at least some of said rerouted packets are dropped, while the packets that have not been rerouted are protected.
11. The method of claim 9 wherein receiving packets comprises receiving voice packets.
12. The method of claim 9 wherein forwarding packets comprises utilizing Fast Reroute.
13. The method of claim 9 wherein the primary tunnel and the backup tunnel are in a MPLS network.
14. The method of claim 9 wherein applying said QoS policy to the demoted packets comprises enforcing said QoS policy such that the non-rerouted packets have priority over the demoted packets.
15. The method of claim 9 wherein marking said rerouted packets comprises marking an EXP field in one or more MPLS label stack entries of the packets.
16. A computer program product for providing QoS in a network after a network failure, the computer program product comprising: code that creates a primary tunnel; code that establishes a backup tunnel protecting a segment of said primary tunnel; code that forwards packets assigned to said primary tunnel via said backup tunnel in response to failure of said primary tunnel segment; code that identifies packets affected by the failure as demoted packets; code that applies to said demoted packets a different QoS policy than applied to packets that have not been rerouted due to the failure; and a computer-readable medium that holds the codes.
17. The computer program product of claim 16 wherein said QoS policy applied to said demoted packets is configured such that: if there is no congestion following the failure, said demoted packets are transmitted in the same manner as the packets that have not been rerouted; and if congestion occurs at least some of said demoted packets are dropped, while the packets that have not been rerouted are protected.
18. The computer program product of claim 16 wherein code that applies said QoS policy to said demoted packets comprises code that enforces said QoS policy such that the non-rerouted packets have priority over the demoted packets.
19. The computer program product of claim 16 wherein code that identifies packets affected by the failure comprises code that marks an EXP field in one or more MPLS label stack entries of the packets.
20. A system for identifying packets rerouted following a failure in a network, the system comprising: a network element located in a path of a primary tunnel in the network and a backup tunnel protecting a segment of said primary tunnel, the network element operable to receive notification of a failure within said primary tunnel and route packets received from said primary tunnel to said backup tunnel, and comprising a demotion apparatus configured to mark said rerouted packets to identify packets affected by the failure as demoted packets such that a differentiated QoS policy can be applied to said demoted packets.
21. The system of claim 20 further comprising a bandwidth manager configured to provide call admission control of voice calls over said primary tunnels.
22. The system of claim 20 wherein the demotion apparatus is configured to mark an EXP field in one or more MPLS label stack entries of the packets.
23. Apparatus for providing QoS in a network after a network failure, the network comprising at least one primary tunnel and at least one backup tunnel protecting a segment of said primary tunnel, the apparatus comprising: means for receiving notification of a failure within the primary tunnel segment and routing of traffic on the primary tunnel segment to the backup tunnel; and means for marking rerouted packets to identify packets affected by the failure; whereby said rerouted packets are subject to a different QoS policy than packets that have not been rerouted due to the failure.
24. The apparatus of claim 23 wherein said QoS policy applied to said rerouted packets is configured such that: if there is no congestion following the failure, said rerouted packets are transmitted in the same manner as the packets that have not been rerouted; and if congestion occurs said rerouted packets have a lower priority than the packets that have not been rerouted.
25. The apparatus of claim 23 further comprising means for ensuring strict QoS voice traffic prior to the failure.
EP06736179.0A 2005-03-23 2006-02-27 Method and system for providing qos during network failure Active EP1861939B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11/088,389 US7852748B2 (en) 2005-03-23 2005-03-23 Method and system for providing voice QoS during network failure
PCT/US2006/006803 WO2006101668A2 (en) 2005-03-23 2006-02-27 Method and system for providing qos during network failure

Publications (3)

Publication Number Publication Date
EP1861939A2 true EP1861939A2 (en) 2007-12-05
EP1861939A4 EP1861939A4 (en) 2010-12-15
EP1861939B1 EP1861939B1 (en) 2013-11-27

Family

ID=37024292

Family Applications (1)

Application Number Title Priority Date Filing Date
EP06736179.0A Active EP1861939B1 (en) 2005-03-23 2006-02-27 Method and system for providing qos during network failure

Country Status (4)

Country Link
US (1) US7852748B2 (en)
EP (1) EP1861939B1 (en)
CN (1) CN101248621A (en)
WO (1) WO2006101668A2 (en)

Families Citing this family (50)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4161557B2 (en) * 2001-09-03 2008-10-08 株式会社日立製作所 Packet transfer method and apparatus
WO2007057884A2 (en) * 2005-11-16 2007-05-24 Corrigent Systems Ltd. Vpls remote failure indication
EP1961154A4 (en) * 2005-12-13 2016-03-09 Audio Pod Inc Segmentation and transmission of audio streams
US7715309B2 (en) * 2006-05-24 2010-05-11 At&T Intellectual Property I, L.P. Method and apparatus for reliable communications in a packet network
US20080069135A1 (en) * 2006-09-19 2008-03-20 International Business Machines Corporation Discreet control of data network resiliency
US8081563B2 (en) * 2006-10-11 2011-12-20 Cisco Technology, Inc. Protecting multi-segment pseudowires
US8767530B2 (en) 2007-02-07 2014-07-01 Futurewei Technologies, Inc. Hierarchical processing and propagation of partial faults in a packet network
US8040797B2 (en) * 2007-02-28 2011-10-18 Cisco Technology, Inc. Sliced tunnels in a computer network
US8274983B2 (en) * 2007-03-13 2012-09-25 Alcatel Lucent Low-impact call connection request denial
US8320381B2 (en) * 2007-03-13 2012-11-27 Alcatel Lucent Application-aware policy enforcement
US8320245B2 (en) * 2007-03-13 2012-11-27 Alcatel Lucent Policy enforcement points
US8320380B2 (en) * 2007-03-13 2012-11-27 Alcatel Lucent Under-assigning resources to video in triple-play virtual topologies to protect data-class traffic
US8711683B2 (en) * 2007-03-19 2014-04-29 Cisco Technology, Inc. Network traffic demotion
US7859993B1 (en) * 2007-06-21 2010-12-28 At&T Intellectual Property Ii, L.P. Two-phase fast reroute with optimized traffic engineering
JP4729119B2 (en) * 2007-10-25 2011-07-20 富士通株式会社 Communication device in label switching network
US8531976B2 (en) * 2008-03-07 2013-09-10 Cisco Technology, Inc. Locating tunnel failure based on next-next hop connectivity in a computer network
US9401855B2 (en) * 2008-10-31 2016-07-26 At&T Intellectual Property I, L.P. Methods and apparatus to deliver media content across foreign networks
US8583832B2 (en) * 2008-12-31 2013-11-12 Verizon Patent And Licensing Inc. Network interface device management using management transport channel
JP5494646B2 (en) 2009-02-25 2014-05-21 日本電気株式会社 Communication network management system, method, and management computer
US8004964B2 (en) * 2009-03-23 2011-08-23 Cisco Technology, Inc. Restoring multi-segment pseudowires following failure of a switching PE device
US8391163B2 (en) 2009-03-23 2013-03-05 Cisco Technology, Inc. Operating MPLS label switched paths and MPLS pseudowire in loopback mode
US8374095B2 (en) * 2009-03-23 2013-02-12 Cisco Technology, Inc. Connection verification for MPLS label switched paths and pseudowires
US8184528B2 (en) * 2009-03-30 2012-05-22 Verizon Patent And Licensing Inc. Network backhaul systems and methods
CN101997754A (en) * 2009-08-21 2011-03-30 中兴通讯股份有限公司 Switching method and system in section protection
CN102238070B (en) * 2010-05-07 2015-04-29 华为技术有限公司 Method, equipment and system for configuring differentiated service mode supported by multi-protocol label switching (MPLS)
US9264328B2 (en) 2011-11-07 2016-02-16 Ciena Corporation Systems and methods for dynamic operations, administration, and management
EP2781065B1 (en) 2011-11-16 2015-10-07 Telefonaktiebolaget L M Ericsson (PUBL) Technique for network routing
CN103947166A (en) * 2011-11-16 2014-07-23 瑞典爱立信有限公司 Conditional routing technique
JP5716712B2 (en) * 2012-07-24 2015-05-13 横河電機株式会社 Packet transfer apparatus and method
US9064149B1 (en) 2013-03-15 2015-06-23 A9.Com, Inc. Visual search utilizing color descriptors
US9306800B2 (en) * 2013-05-10 2016-04-05 Telefonaktiebolaget L M Ericsson (Publ) Inter-domain fast reroute methods and network devices
CN104378292B (en) * 2013-08-15 2018-01-23 华为技术有限公司 A kind of method and device of forwarding MPLS packets
ES2530592B1 (en) * 2013-08-29 2015-12-09 Vodafone España, S.A.U. Communications system, network elements and procedure to facilitate the routing of data packets
US9876711B2 (en) 2013-11-05 2018-01-23 Cisco Technology, Inc. Source address translation in overlay networks
DE102014206053A1 (en) 2014-03-31 2015-10-01 Siemens Aktiengesellschaft Increase a quality of service in a network
US9980179B2 (en) * 2014-05-15 2018-05-22 Cisco Technology, Inc. Managing computational resources in a network environment
US10116493B2 (en) 2014-11-21 2018-10-30 Cisco Technology, Inc. Recovering from virtual port channel peer failure
US9667538B2 (en) * 2015-01-30 2017-05-30 Telefonaktiebolget L M Ericsson (Publ) Method and apparatus for connecting a gateway router to a set of scalable virtual IP network appliances in overlay networks
CN106936683B (en) * 2015-12-31 2019-09-17 北京网御星云信息技术有限公司 A kind of method and device for realizing tunnel configuration
US10142163B2 (en) 2016-03-07 2018-11-27 Cisco Technology, Inc BFD over VxLAN on vPC uplinks
CN105657748B (en) * 2016-03-16 2020-06-26 华为技术有限公司 Communication method and network equipment based on tunnel binding
US10333828B2 (en) 2016-05-31 2019-06-25 Cisco Technology, Inc. Bidirectional multicasting over virtual port channel
US11509501B2 (en) 2016-07-20 2022-11-22 Cisco Technology, Inc. Automatic port verification and policy application for rogue devices
US10193750B2 (en) 2016-09-07 2019-01-29 Cisco Technology, Inc. Managing virtual port channel switch peers from software-defined network controller
US10547509B2 (en) 2017-06-19 2020-01-28 Cisco Technology, Inc. Validation of a virtual port channel (VPC) endpoint in the network fabric
CN107547388B (en) * 2017-08-24 2021-03-09 新华三技术有限公司 Message sending method and device
US10581638B2 (en) 2018-04-18 2020-03-03 Hewlett Packard Enterprise Development Lp Assign tunnel tag identifying virtual local area network tunnel
US11223567B2 (en) * 2019-01-18 2022-01-11 Cisco Technology, Inc. Transmission control protocol session mobility
US11070480B2 (en) * 2019-07-03 2021-07-20 Kaloom Inc. Method and computing devices for enforcing packet order based on packet marking
CN112600712B (en) * 2020-12-24 2022-05-27 新华三大数据技术有限公司 Service quality scheduling method and device

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020093954A1 (en) * 2000-07-05 2002-07-18 Jon Weil Failure protection in a communications network
US20030043735A1 (en) * 2001-08-31 2003-03-06 Hitachi, Ltd. Packet transmission method

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5253248A (en) * 1990-07-03 1993-10-12 At&T Bell Laboratories Congestion control for connectionless traffic in data networks via alternate routing
US7009934B1 (en) * 1999-03-01 2006-03-07 Ciena Corporation Method and apparatus for rerouting an optical network upon fault
WO2001020829A1 (en) * 1999-09-14 2001-03-22 Megaxess, Inc. Method and apparatus for prevention of congestion in atm networks through atm protection switching
US6865149B1 (en) * 2000-03-03 2005-03-08 Luminous Networks, Inc. Dynamically allocated ring protection and restoration technique
US20020004843A1 (en) * 2000-07-05 2002-01-10 Loa Andersson System, device, and method for bypassing network changes in a routed communication network
US7039005B2 (en) * 2001-10-02 2006-05-02 Fujitsu Limited Protection switching in a communications network employing label switching

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020093954A1 (en) * 2000-07-05 2002-07-18 Jon Weil Failure protection in a communications network
US20030043735A1 (en) * 2001-08-31 2003-03-06 Hitachi, Ltd. Packet transmission method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
JEAN-PHILIPPE VASSEUR (ED) ANNA CHARNY (ED) FRANCOIS LE FAUCHEUR(ED) CISCO SYSTEMS ET AL: "draft-vasseur-mpls-backup-computation-02. txt MPLS Traffic Engineering Fast reroute: bypass tunnel path computation for bandwidth protection; draft-vasseur-mpls-backup-computation-02.t xt" IETF STANDARD-WORKING-DRAFT, INTERNET ENGINEERING TASK FORCE, IETF, CH, no. 2, 1 February 2003 (2003-02-01), XP015005595 ISSN: 0000-0004 *
LE FAUCHEUR F ET AL: "Multi-Protocol Label Switching (MPLS) Support of Differentiated Services; rfc3270.txt" IETF STANDARD, INTERNET ENGINEERING TASK FORCE, IETF, CH, 1 May 2002 (2002-05-01), XP015009048 ISSN: 0000-0003 *
See also references of WO2006101668A2 *

Also Published As

Publication number Publication date
WO2006101668A2 (en) 2006-09-28
EP1861939A4 (en) 2010-12-15
CN101248621A (en) 2008-08-20
WO2006101668A3 (en) 2008-01-17
EP1861939B1 (en) 2013-11-27
US7852748B2 (en) 2010-12-14
US20060215548A1 (en) 2006-09-28

Similar Documents

Publication Publication Date Title
US7852748B2 (en) Method and system for providing voice QoS during network failure
US8711683B2 (en) Network traffic demotion
EP1461721B1 (en) Implicit shared bandwidth protection for fast reroute
EP1671440B1 (en) Enhanced switchover for mpls fast reroute
AU2003205145B2 (en) Load balancing for fast reroute backup tunnels
EP1759301B1 (en) Scalable mpls fast reroute switchover with reduced complexity
US7230913B1 (en) MPLS fast reroute without full mesh traffic engineering
US20160254992A1 (en) Apparatus, system, and method for reconfiguring point-to-multipoint label-switched paths
US20020093954A1 (en) Failure protection in a communications network
AU2003205145A1 (en) Load balancing for fast reroute backup tunnels
Petersson MPLS based recovery mechanisms
Cisco MPLS QoS Multi-VC Mode for PA-A3
Cisco MPLS QoS Multi-VC Mode for PA-A3
DeCusatis et al. Quality of service for converged data and voice over IP networks
Medvecky The Efficiency of Constraint Based Routing in MPLS Networks
Fan A Backup LSP Bandwidth Reallocation Mechanism in MPLS Networks

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20070726

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

R17D Deferred search report published (corrected)

Effective date: 20080117

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/56 20060101AFI20080212BHEP

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20101116

17Q First examination report despatched

Effective date: 20110823

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602006039423

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04J0003140000

Ipc: H04L0012707000

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/703 20130101ALI20130514BHEP

Ipc: H04L 12/823 20130101ALN20130514BHEP

Ipc: H04L 12/725 20130101ALI20130514BHEP

Ipc: H04L 12/835 20130101ALN20130514BHEP

Ipc: H04L 12/801 20130101ALN20130514BHEP

Ipc: H04L 12/833 20130101ALN20130514BHEP

Ipc: H04L 12/707 20130101AFI20130514BHEP

Ipc: H04L 12/851 20130101ALN20130514BHEP

Ipc: H04L 12/927 20130101ALN20130514BHEP

Ipc: H04L 12/773 20130101ALI20130514BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20130621

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 643077

Country of ref document: AT

Kind code of ref document: T

Effective date: 20131215

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602006039423

Country of ref document: DE

Effective date: 20140123

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20131127

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 643077

Country of ref document: AT

Kind code of ref document: T

Effective date: 20131127

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20140327

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20140327

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006039423

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20140227

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140228

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140228

26N No opposition filed

Effective date: 20140828

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602006039423

Country of ref document: DE

Effective date: 20140828

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20140227

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20140228

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20060227

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20131127

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602006039423

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0012707000

Ipc: H04L0045240000

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 18

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240207

Year of fee payment: 19

Ref country code: GB

Payment date: 20240212

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240228

Year of fee payment: 19