US7359386B2 - Soft preemption feedback - Google Patents

Soft preemption feedback Download PDF

Info

Publication number
US7359386B2
US7359386B2 US10/725,606 US72560603A US7359386B2 US 7359386 B2 US7359386 B2 US 7359386B2 US 72560603 A US72560603 A US 72560603A US 7359386 B2 US7359386 B2 US 7359386B2
Authority
US
United States
Prior art keywords
label switched
proposed
preemption
node
time period
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.)
Expired - Lifetime, expires
Application number
US10/725,606
Other languages
English (en)
Other versions
US20050117512A1 (en
Inventor
Jean Philippe Vasseur
Ramesh Uppili
Carol Iturralde
Muthurajah Sivabalan
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
Priority to US10/725,606 priority Critical patent/US7359386B2/en
Assigned to CICSO TECHNOLOGY, INC. reassignment CICSO TECHNOLOGY, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ITURRALDE, CAROL, VASSEUR, JEAN PHILIPPE, SIVABALAN, MUTHURAJAH, UPPILI, RAMESH
Priority to EP04810789A priority patent/EP1695313B1/de
Priority to CNB2004800334755A priority patent/CN100484046C/zh
Priority to PCT/US2004/037728 priority patent/WO2005060463A2/en
Priority to AT04810789T priority patent/ATE556516T1/de
Publication of US20050117512A1 publication Critical patent/US20050117512A1/en
Application granted granted Critical
Publication of US7359386B2 publication Critical patent/US7359386B2/en
Adjusted expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

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
    • 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
    • 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/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • 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/245—Traffic characterised by specific attributes, e.g. priority or QoS using preemption
    • 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
    • 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
    • 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/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
    • H04L47/765—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the end-points
    • 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/824—Applicable to portable or mobile terminals
    • 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
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/826—Involving periods of time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40—Network security protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/28—Timers or timing mechanisms used in protocols

Definitions

  • the present invention relates to data networking and more particularly, in certain embodiments, to systems and methods for preempting lower priority traffic.
  • MPLS Traffic Engineering has been developed to meet data networking requirements such as guaranteed available bandwidth.
  • MPLS Traffic Engineering exploits modern label switching techniques to build guaranteed bandwidth end-to-end tunnels through an IP network of labels switched routers (LSRs). These tunnels are a type of label switched path (LSP) and thus are generally referred to as MPLS Traffic Engineering LSPs.
  • LSRs labels switched routers
  • MPLS Traffic Engineering LSPs traverse a series of nodes and links that interconnect them. To maintain the bandwidth guarantee, any given link can only accommodate MPLS Traffic Engineering LSPs having an aggregate bandwidth less than or equal to that link's advertised capacity.
  • MPLS Traffic Engineering LSPs may be assigned priority levels based on, e.g. their traffic type. For example, there may be eight priority levels with voice traffic being given a relatively high priority level. Priority levels may also be determined based on customer service level agreements (SLAs). Priorities may also be assigned based on the LSP size to increase the likelihood of finding a path.
  • SLAs customer service level agreements
  • a new traffic engineering LSP is established by way of signaling from the proposed LSP's head-end. Nodes along the proposed LSP's path will determine whether or not to admit or accept the proposed LSP based on available bandwidth on the link to the next node. It may be the case, however, that although there is insufficient unused bandwidth to accommodate the new LSP, some of the currently configured traffic is lower priority than the new LSP.
  • preemption of lower priority LSPs may occur at multiple nodes along the path of a proposed new LSP. Some of the lower priority LSPs that are candidates for preemption may follow paths that overlap the path of the preempting LSP at more than one node. Each preempting node, however, independently determines which lower priority LSP(s) to preempt.
  • the preemption algorithms and their inputs may however vary among the preempting nodes leading to inconsistent choices. Because each preempting node is unaware of the choices of the other preempting nodes, more bandwidth may be preempted than is necessary. Also, since a larger number of preempted LSPs than is necessary require rerouting, there is an undue signaling burden.
  • the distributed but uncoordinated nature of the preemption processes raises another difficulty.
  • Multiple nodes along the path of a proposed LSP may preempt the same lower priority LSP.
  • the head-end of the lower priority LSP may begin its reroute in reaction to the first indication of preemption.
  • the computation of a new path will thus not take into account that in fact multiple nodes along the old path are now unavailable rather than the one node which first reported preemption.
  • the head-end may then inadvertently attempt to reroute the path through congested nodes, resulting in rejection of the proposed reroute and further burdensome signaling to accomplish successful rerouting.
  • Embodiments of the present invention provide systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links.
  • the efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited.
  • the amount of signaling may also be significantly reduced.
  • these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.
  • One aspect of the present invention provides a method for operating a node in a label switched network.
  • the method includes: receiving a request to establish a proposed label switched path through the node, determining that a bandwidth requirement of the proposed label switched path cannot currently be met, after receiving the request and prior to expiration of a time period, receiving information from one or more downstream nodes along the proposed label switched path identifying one or more currently configured label switched paths that have been preempted downstream, and after expiration of the time period, selecting one or more label switched paths to preempt from among currently configured label switched paths, the selecting being based at least in part on the received information.
  • FIG. 1 depicts a representative preemption scenario according to one embodiment of the present invention.
  • FIG. 2 is a flow chart describing steps of preemption of one or more currently configured LSPs to make room for a proposed LSP according to one embodiment of the present invention.
  • FIG. 3 depicts a network device useful in implementing embodiments of the present invention.
  • the present invention will be described with reference to a representative network environment and employs a certain combination of network protocols to forward data through the network.
  • the links may be implemented using any type of physical medium such as, e.g., an optical medium, wireless medium, twisted pair, etc. Links may also be logical connections that give the connected nodes the property of adjacency in view of the operative networking protocols.
  • the nodes of such a network interoperate in a manner specified by various protocols including e.g., TCP/IP and protocols defined by the following documents:
  • Vasseur et al., “Definition of an RRO node-ID subobject,” Internet Draft, Internet Engineering Task Force, May 2003.
  • the nodes of the example network are IP routers that implement multiprotocol label switching (MPLS) and operate as label switched routers (LSRs).
  • MPLS multiprotocol label switching
  • LSRs label switched routers
  • a label is assigned to each incoming packet based on its forwarding equivalence class before forwarding the packet to the next hop node.
  • a forwarding selection and a new substitute label are determined by using the label found in the incoming packet as a reference to a label forwarding table that includes this information.
  • a forwarding decision is made based on the incoming label but optionally no label is included when the packet is sent on to the next hop.
  • LSPs label switched paths
  • MPLS Traffic Engineering establishes LSPs that have guaranteed bandwidth. Each MPLS Traffic Engineering LSP thus has a bandwidth requirement. Sufficient bandwidth is reserved on each link in the MPLS Traffic Engineering LSP to assure that the bandwidth guarantee is met. Bandwidth reserved on a link for one LSP is not available for other LSPs, except under certain circumstances. The total bandwidth reserved on a link should not exceed the link's advertised capacity.
  • Traffic Engineering LSPs may have different priorities depending on the type of traffic that they serve. In the scheme defined by the above-mentioned RFC 3209, there are eight priority levels, 0-7. Each LSP has a setup priority and a hold priority. The setup priority is used to decide whether a given LSP can preempt another LSP. The hold priority is used to determine whether a given LSP can be preempted by another LSP.
  • FIG. 1 depicts a simple preemption scenario useful in illustrating embodiments of the present invention.
  • a network fragment is depicted and includes six nodes: a head-end node 102 , four intermediate nodes 104 , 106 , 108 , and 110 , and a destination node 112 .
  • the link between head-end 102 and intermediate node 104 has a bandwidth of 110 units as does the link between intermediate node 104 and intermediate node 106 .
  • the links from intermediate node 106 through to destination node 112 all have a bandwidth of 80 units.
  • LSPs there are three currently configured LSPs that extend from head-end node 102 to destination node 112 through all four intermediate nodes.
  • LSP A with a bandwidth of 30 units and a priority level of three
  • LSP B with a bandwidth of 20 units and a priority level of 4
  • LSP C with a bandwidth of 10 units and a priority level of 5. It can be seen then that the bandwidth between intermediate node 106 and destination node 112 is fully occupied while some bandwidth remains between head-end 102 and intermediate node 106 .
  • the present invention will be illustrated by an example where a new LSP D is proposed to be established.
  • Proposed LSP D has a bandwidth of 50 units and a priority level of 2 and would include the same nodes as the three currently configured LSPs.
  • Head-end node 102 and intermediate node 104 can themselves accommodate the new LSP without displacing other traffic because their outbound links have sufficient remaining bandwidth.
  • Intermediate nodes 106 , 108 , and 110 do not have sufficient bandwidth on their outbound links and will have to preempt lower priority traffic in order to accommodate the new proposed LSP.
  • FIG. 2 is a flow chart describing steps of preempting lower priority traffic according to one embodiment of the present invention.
  • FIG. 2 will be described from the perspective of the operation of intermediate node 108 in the example of FIG. 1 .
  • intermediate node 108 receives a request to establish LSP D.
  • the request typically comes in the form of an RSVP PATH message whose contents are specified by RFC 3209.
  • the PATH message flows downstream over the proposed route.
  • the request specifies the needed bandwidth.
  • Intermediate node 108 is currently carrying traffic totaling 60 units on its outbound link to intermediate node 110 and is now being asked to accommodate another 50 bandwidth units. Since the capacity on this outbound link is only 80, 30 bandwidth units of other traffic will have to be preempted to accommodate the new LSP. This will be possible because the new proposed LSP D has a priority level of two which is higher priority than any of the currently configured LSPs.
  • intermediate node 108 sends a response upstream towards head-end 102 accepting and establishing the proposed LSP.
  • a response takes the form of an RSVP RESV message that includes a label to be used by the previous intermediate node 106 in forwarding traffic for the new LSP.
  • the RESV message contents are specified by RFC 3209. It will be appreciated that the new LSP is being signaled even though the bandwidth to accommodate it is not yet available as preemption has not yet taken place. This is done to avoid delay in the signaling of the new LSP.
  • a timer is initialized and started to define a duration during which intermediate node 108 can learn of preemption decisions made downstream along the proposed LSP.
  • the timer value is set proportionately to the number of hops on the way to the proposed LSP destination. Here there are two hops between destination node 112 and intermediate node 108 .
  • the number of hops may be evaluated by analyzing the number of RRO (Record Route) node-id sub-objects in the PATH message establishing the proposed LSP.
  • the number of hops can be determined based on knowledge of the IP address of destination node 112 as found in the PATH message and knowledge of network topology as would be found in a database maintained by the locally operative Interior Gateway Protocol (IGP).
  • IGP Interior Gateway Protocol
  • the time interval by which to multiply the number of hops may be determined empirically.
  • intermediate node 108 receives information identifying which LSPs have been preempted by downstream nodes.
  • the only downstream node is intermediate node 110 .
  • the information is included in an RSVP RESV message that flows upstream.
  • an RRO subobject identifying the preempted LSP Within this RRO subobject, there is a preemption pending flag provided by the present invention. This flag is set to indicate preemption of the LSP.
  • a single RESV message flowing upstream towards head-end 102 may accumulate multiple RRO sub-objects giving preemption information for multiple intermediate nodes.
  • the timer set at step 206 expires.
  • Now intermediate node 108 can decide which lower priority LSP(s) to preempt to make room for proposed LSP D.
  • One possible preemption algorithm would be to begin with the lowest priority currently configured LSP, select that one for preemption and continue up the list of currently configured LSPs in order of priority until enough bandwidth is accumulated. In the present example, this would result in the selection of LSP B and LSP C for preemption.
  • Another possible preemption selection algorithm selects the smallest number of lower priority LSPs to preempt. This would result in the selection of LSP A for preemption.
  • intermediate nodes 106 , 108 , and 110 may make different selections due to the use of different algorithms. This may be because node equipment is provided by different vendors. In more complex examples, where there are a variety of LSP routes, different preemption selections result from varying choices of lower priority LSPs to preempt.
  • intermediate node 108 takes into account the preemption decisions of downstream nodes.
  • Intermediate node 108 can select either LSP A or a combination of LSP B and LSP C for preemption.
  • intermediate node 108 makes the same selection as intermediate node 110 regardless of the locally operative selection algorithm. Then if more LSPs must be preempted to accommodate the proposed LSPs, the intermediate node triggers its locally operative preemption algorithm.
  • a given node may take into account the selections of downstream nodes in making its preemption decision so as to minimize preempted traffic. For example, the preempting node first selects for preemption all of the LSPs that use the affected link and have already been preempted by downstream nodes. Then the locally operative preemption selection algorithm harvests any remaining needed bandwidth.
  • intermediate node 108 notifies head-end 102 of its preemption selection(s).
  • Intermediate node 108 notifies by employing an RRO sub-object or sub-objects identifying any preempted LSPs.
  • the RROs are included in an RESV message sent upstream.
  • the previously mentioned preemption flags are set.
  • the RROs indicating the preemption decision of intermediate node 108 may be included in an RESV message that propagates upstream accumulating the preemption decisions of the intermediate nodes along the way.
  • head-end 102 attempts to reroute the preempted LSPs. Head-end 102 deletes the preempting links from its route topology database before computing new paths. This greatly increases the likelihood that the new paths will be accepted since they will not attempt to use links that are already congested.
  • embodiments of the present invention provide for coordination of distributed preemption decisions. This reduces the number of LSPs and/or volume of traffic that need to be preempted to accommodate a given level of higher priority traffic. Since fewer LSPs are preempted, signaling associated with rerouting is reduced. Since the head-end is aware of all nodes that have preempted a particular LSP due to congestion, the rerouted path will omit these links and be less likely to be refused and rerouted yet again, thus providing further economy in signaling.
  • FIG. 3 depicts a network device 300 that may be used to implement, e.g., any of the nodes of FIG. 1 and/or perform any of the steps of FIG. 2 .
  • network device 300 is a programmable machine that may be implemented in hardware, software or any combination thereof.
  • a processor 302 executes code stored in a program memory 304 .
  • Program memory 304 is one example of a computer-readable medium.
  • Program memory 304 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, hard disks, flash memory, etc.
  • a carrier wave that carries the code across a network is another example of a computer-readable medium.
  • Network device 300 interfaces with physical media via a plurality of linecards 306 .
  • Linecards 306 may incorporate Ethernet interfaces, DSL interfaces, Gigabit Ethernet interfaces, 10-Gigabit Ethernet interfaces, SONET interfaces, etc.
  • packets are received, processed, and forwarded by network device 300 , they may be stored in a packet memory 308 .
  • Network device 300 implements all of the network protocols and extensions thereof described above as well as the data networking features provided by the present invention.
  • control plane operations such as the LSP admission and preemption operations described above are controlled and signaled by processor 302 while forwarding tables are maintained on linecards 306 .
  • the present invention is, however, not limited to a distributed architecture. Packet forwarding operations may occur partially or completely within one of linecards 306 or be divided between the ingress and egress linecards encountered by a particular packet.
  • linecards 306 may incorporate processing and memory resources similar to those discussed above in connection with the network device as a whole.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Measuring Pulse, Heart Rate, Blood Pressure Or Blood Flow (AREA)
  • Steroid Compounds (AREA)
US10/725,606 2003-12-02 2003-12-02 Soft preemption feedback Expired - Lifetime US7359386B2 (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
US10/725,606 US7359386B2 (en) 2003-12-02 2003-12-02 Soft preemption feedback
EP04810789A EP1695313B1 (de) 2003-12-02 2004-11-10 Soft-präemptions-rückkopplung
CNB2004800334755A CN100484046C (zh) 2003-12-02 2004-11-10 软抢占反馈
PCT/US2004/037728 WO2005060463A2 (en) 2003-12-02 2004-11-10 Soft preemption feedback
AT04810789T ATE556516T1 (de) 2003-12-02 2004-11-10 Soft-präemptions-rückkopplung

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/725,606 US7359386B2 (en) 2003-12-02 2003-12-02 Soft preemption feedback

Publications (2)

Publication Number Publication Date
US20050117512A1 US20050117512A1 (en) 2005-06-02
US7359386B2 true US7359386B2 (en) 2008-04-15

Family

ID=34620293

Family Applications (1)

Application Number Title Priority Date Filing Date
US10/725,606 Expired - Lifetime US7359386B2 (en) 2003-12-02 2003-12-02 Soft preemption feedback

Country Status (5)

Country Link
US (1) US7359386B2 (de)
EP (1) EP1695313B1 (de)
CN (1) CN100484046C (de)
AT (1) ATE556516T1 (de)
WO (1) WO2005060463A2 (de)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120250696A1 (en) * 2011-03-31 2012-10-04 Rakesh Gandhi Soft Preemption For Minimizing Preemptions In A Network
US8824488B2 (en) 2010-12-10 2014-09-02 At&T Intellectual Property I, L.P. Methods, apparatus and articles of manufacture to select label switched paths (LSPs) for preemption
US11291005B2 (en) * 2017-08-08 2022-03-29 Aviat U.S., Inc. Traffic management technique for variable bandwidth networks using RSVP
US12500832B2 (en) 2023-08-28 2025-12-16 Ciena Corporation Establishing and advertising co-routed bidirectional paths across multiple domains
US12519712B2 (en) 2024-03-04 2026-01-06 Ciena Corporation Flexible and scalable automatic next-hop resolution in traffic engineering networks

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7706411B2 (en) * 2004-03-29 2010-04-27 Hewlett-Packard Development Company, L.P. Handling oversubscribed mesh ports with re-tagging
US7953000B2 (en) * 2004-09-10 2011-05-31 Cisco Technology, Inc. Mechanism to improve preemption behavior of resource reservations
US7957276B2 (en) * 2005-04-28 2011-06-07 Telcordia Licensing Company, Llc Call admission control and preemption control over a secure tactical network
US20070030852A1 (en) * 2005-08-08 2007-02-08 Mark Szczesniak Method and apparatus for enabling routing of label switched data packets
US20070030846A1 (en) * 2005-08-08 2007-02-08 Mark Szczesniak Method and apparatus for enabling routing of label switched data packets
US7933237B2 (en) 2005-12-23 2011-04-26 Telcordia Licensing Company, Llc Ensuring quality of service of communications in networks
US8966113B2 (en) * 2006-03-03 2015-02-24 Cisco Technology, Inc. Technique for dynamically restoring original TE-LSP attributes for interdomain TE-LSPs
US7693055B2 (en) * 2006-12-22 2010-04-06 Cisco Technology, Inc. Optimization of distributed tunnel rerouting in a computer network with intermediate node feedback
US8369213B2 (en) 2006-12-22 2013-02-05 Cisco Technology, Inc. Optimization of distributed tunnel rerouting in a computer network with path computation at an intermediate node
US8189482B2 (en) * 2007-02-20 2012-05-29 Cisco Technology, Inc. Probing-based mechanism to reduce preemption perturbation caused by higher priority tunnel establishment in a computer network
CN101321115B (zh) * 2007-06-07 2010-10-13 华为技术有限公司 一种业务路径建立的方法和系统以及节点设备
US8867529B2 (en) 2010-09-20 2014-10-21 Cisco Technology, Inc. System and method for providing a fate sharing identifier in a network environment
US20130232193A1 (en) * 2012-03-04 2013-09-05 Zafar Ali Control-Plane Interface Between Layers in a Multilayer Network
US9450882B2 (en) 2012-04-23 2016-09-20 Cisco Technology, Inc. Method and apparatus for supporting call admission control using graph assembly and fate-share identifiers
JP6228822B2 (ja) * 2013-11-21 2017-11-08 株式会社日立製作所 ネットワーク管理制御装置、ネットワーク管理制御システム、及びネットワーク管理制御方法
CN104038443A (zh) 2014-06-16 2014-09-10 华为技术有限公司 一种网络中建立硬管道方法、转发报文方法和装置
US12452158B2 (en) 2022-02-18 2025-10-21 Ciena Corporation Stitching a segment routing (SR) policy to a local SR policy for routing through a downstream SR domain

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020141345A1 (en) 2001-01-30 2002-10-03 Balazs Szviatovszki Path determination in a data network
US20030067880A1 (en) * 2001-10-10 2003-04-10 Girish Chiruvolu System and method for routing stability-based integrated traffic engineering for GMPLS optical networks
US20030185217A1 (en) * 2002-03-28 2003-10-02 Sudhakar Ganti Label distribution protocol supporting multiple classes of service in a multi protocol label switching (MPLS) network, methods and MPLS network using thereof

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020141345A1 (en) 2001-01-30 2002-10-03 Balazs Szviatovszki Path determination in a data network
US20030067880A1 (en) * 2001-10-10 2003-04-10 Girish Chiruvolu System and method for routing stability-based integrated traffic engineering for GMPLS optical networks
US20030185217A1 (en) * 2002-03-28 2003-10-02 Sudhakar Ganti Label distribution protocol supporting multiple classes of service in a multi protocol label switching (MPLS) network, methods and MPLS network using thereof

Non-Patent Citations (9)

* Cited by examiner, † Cited by third party
Title
Awduche et al., "Requirements for Traffic Engineering Over MPLS," RFC 2702, Internet Engineering Task Force, Sep. 1999.
Awduche et al., "RSVP-TE: Extensions to RSVP for LSP Tunnels," RFC 3209, Internet Engineering Task Force, Dec. 2001.
Berger et al., "Generalized MPLS Signaling-RSVP-TE Extensions," RFC 3473, Internet Engineering Task Force, Jan. 2003.
Braden et al., "Resource ReSerVation Protocol (RSVP)-Version 1 Functional Specification," RFC 2205, Internet Engineering Task Force, Sep. 1977.
E. Rosen et al., Multiprotocol Label Switching Architecture, RFC 3031, Internet Engineering Task Force, Jan. 2001.
Le Faucheur et al., "Requirements for Support of Diff-Serv-Aware MPLS Traffic Engineering," RFC 3564, Internet Engineering Task Force,Jul. 2003.
Meyer et al., "MPLS Traffic Engineering Soft Preemption," Internet Draft, Internet Engineering Task Force, Feb. 2003.
Pan et al., "Fast Reroute Extensions to RSVP-TE for LSP Tunnels," Internet Draft, Internet Engineering Task Force, Dec. 2003.
Vasseur et al., "Definition of an RRO Node-ID Subobject," Internet Draft, Internet Engineering Task Force, May 2003.

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8824488B2 (en) 2010-12-10 2014-09-02 At&T Intellectual Property I, L.P. Methods, apparatus and articles of manufacture to select label switched paths (LSPs) for preemption
US20120250696A1 (en) * 2011-03-31 2012-10-04 Rakesh Gandhi Soft Preemption For Minimizing Preemptions In A Network
US8462638B2 (en) * 2011-03-31 2013-06-11 Cisco Technology, Inc. Soft preemption for minimizing preemptions in a network
WO2012134617A3 (en) * 2011-03-31 2014-03-13 Cisco Technology, Inc. Soft preemption for minimizing preemptions in a network
US11291005B2 (en) * 2017-08-08 2022-03-29 Aviat U.S., Inc. Traffic management technique for variable bandwidth networks using RSVP
US12167382B2 (en) 2017-08-08 2024-12-10 Aviat U.S., Inc. Traffic management technique for variable bandwidth networks using RSVP
US12500832B2 (en) 2023-08-28 2025-12-16 Ciena Corporation Establishing and advertising co-routed bidirectional paths across multiple domains
US12519712B2 (en) 2024-03-04 2026-01-06 Ciena Corporation Flexible and scalable automatic next-hop resolution in traffic engineering networks

Also Published As

Publication number Publication date
EP1695313B1 (de) 2012-05-02
CN100484046C (zh) 2009-04-29
CN1902856A (zh) 2007-01-24
US20050117512A1 (en) 2005-06-02
EP1695313A2 (de) 2006-08-30
WO2005060463A3 (en) 2006-10-05
EP1695313A4 (de) 2010-11-24
WO2005060463A2 (en) 2005-07-07
ATE556516T1 (de) 2012-05-15

Similar Documents

Publication Publication Date Title
US7359386B2 (en) Soft preemption feedback
US7031262B2 (en) Reoptimization triggering by path computation elements
US6956821B2 (en) Path determination in a data network
US7345994B2 (en) Transparent re-routing of MPLS traffic engineering LSPs within a link bundle
US7184434B2 (en) Label distribution protocol supporting multiple classes of service in a multi protocol label switching (MPLS) network, methods and MPLS network using thereof
US8369213B2 (en) Optimization of distributed tunnel rerouting in a computer network with path computation at an intermediate node
US8189482B2 (en) Probing-based mechanism to reduce preemption perturbation caused by higher priority tunnel establishment in a computer network
US7660254B2 (en) Optimization of distributed tunnel rerouting in a computer network with coordinated head-end node path computation
US8005103B2 (en) Network routing method and system utilizing label-switching traffic engineering queues
US8312145B2 (en) Traffic engineering and bandwidth management of bundled links
US7693055B2 (en) Optimization of distributed tunnel rerouting in a computer network with intermediate node feedback
US9571381B2 (en) System and method for inter-domain RSVP-TE LSP load balancing
US10637775B2 (en) Make-before-break mechanism for label switched paths
US7801048B1 (en) Concurrent path computation using virtual shortest path tree
KR100392646B1 (ko) 멀티-프로토콜 라벨 스위칭 방식이 적용된 데이터통신망에서의 프로텍션 스위칭을 위한 트래픽 경로 설정방법
Chaieb et al. A new pre-emption policy for mpls-te networks
Kim et al. Load balancing using modified cost function for constraint-based routing over MPLS networks
Velayutham An approach to integrate QoS, traffic engineering and fault tolerance in an MPLS network

Legal Events

Date Code Title Description
AS Assignment

Owner name: CICSO TECHNOLOGY, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VASSEUR, JEAN PHILIPPE;UPPILI, RAMESH;ITURRALDE, CAROL;AND OTHERS;REEL/FRAME:014760/0070;SIGNING DATES FROM 20031124 TO 20031126

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12