WO2014018297A1 - System and method using rsvp hello suppression for graceful restart capable neighbors - Google Patents

System and method using rsvp hello suppression for graceful restart capable neighbors Download PDF

Info

Publication number
WO2014018297A1
WO2014018297A1 PCT/US2013/050536 US2013050536W WO2014018297A1 WO 2014018297 A1 WO2014018297 A1 WO 2014018297A1 US 2013050536 W US2013050536 W US 2013050536W WO 2014018297 A1 WO2014018297 A1 WO 2014018297A1
Authority
WO
WIPO (PCT)
Prior art keywords
hello
neighboring node
mode
node
neighboring
Prior art date
Application number
PCT/US2013/050536
Other languages
French (fr)
Inventor
Pradeep G. Jain
Kanwar D. Singh
Santoshkumar RAMAMURTHY
Original Assignee
Alcatel-Lucent Usa 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 Alcatel-Lucent Usa Inc. filed Critical Alcatel-Lucent Usa Inc.
Priority to EP13742112.9A priority Critical patent/EP2878105B1/en
Priority to CN201380039529.8A priority patent/CN104541482B/en
Priority to JP2015524313A priority patent/JP6017037B6/en
Priority to KR1020157002103A priority patent/KR101652649B1/en
Publication of WO2014018297A1 publication Critical patent/WO2014018297A1/en

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/02—Topology update or discovery
    • H04L45/04—Interdomain routing, e.g. hierarchical routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0686—Additional information in the notification, e.g. enhancement of specific meta-data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0659—Management of faults, events, alarms or notifications using network fault recovery by isolating or reconfiguring faulty entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06—Management of faults, events, alarms or notifications
    • H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668—Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
    • 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/02—Topology update or discovery
    • H04L45/026—Details of "hello" or keep-alive messages
    • 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/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/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • 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/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]

Definitions

  • the HELLO messages are exchanged at a fairly regular interval on a per-neighbor basis. Having multiple interfaces/neighbors increases the number of HELLO messages that need to be exchanged, resulting in a significant control plane overhead. This control plane overhead is reduced by reducing the interval between HELLO message exchanges. However, this increased interval may result in a delayed failover (resulting in dropped traffic) or a delay in recognizing that an apparently failed node is back in operation (resulting in inefficient use of the restored node).
  • FIG. 3 depicts a flow diagram of a method according to one
  • the network node or router establishes a neighboring node relationship with other directly connected nodes or routers. That is, each of the nodes within the network interacts with directly connected nodes to establish mutual neighboring node relationships. Referring to box 215, this relationship may be established using RSVP message exchanges and/or other message exchanges.
  • the methods 200/300 described above with respect to FIGS. 2 and 3 contemplate opportunistically entering and exiting a hello suppression mode at one or more of a plurality of network elements.
  • the nodes will exit the Hello Suppression mode in response to (1 ) detection of a node control plane failure; (2) link failure; (3) neighboring node graceful restart; (4) Restart_Cap Object Change; (5) and/or a Hello Suppression disable message, illustratively as follows.
  • node R2 After a restart of node R2 in which Graceful Restart is not enabled, node R2 will send a HELLO message to node R1 not including a Restart_Cap object. If R1 and R2 and already entered the Hello Suppression mode and Graceful Restart is enabled on node R1 , then R1 will start re-sending the HELLO messages.
  • the HELLO messages will carry the Restart_Cap Object as described in RFC 3473 and the Hello_Suppress Object with the REQUEST field set to (1 ) and ACK field set to (0).
  • cooperating process 405 can be loaded into memory 404 and executed by processor 403 to implement the functions as discussed herein.
  • cooperating process 405 (including associated data structures) can be stored on a computer readable storage medium, e.g., RAM memory, magnetic or optical drive or diskette, and the like.

Landscapes

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

Abstract

A system, method and apparatus adapting one or more routers or nodes in a network to operate in a first mode to exchange hello messages with neighboring nodes to indicate thereby active or live status, and to operate in a second mode to avoid the use of hello messages by opportunistically relying upon service or management protocols to convey active or live status.

Description

SYSTEM AND METHOD USING RSVP HELLO SUPPRESSION FOR GRACEFUL RESTART CAPABLE NEIGHBORS
CROSS REFERENCE TO RELATED APPLICATION
This application claims the benefit of pending U.S. Provisional Patent
Application Serial No. 61/676,796, filed July 27, 2012, entitled SYSTEM, METHOD AND APPARATUS FOR IMPROVED MPLS MANAGEMENT, which application is incorporated herein by reference in its entirety. FIELD OF THE INVENTION
The invention relates generally to communication networks and, more specifically but not exclusively, to efficient detection and processing of neighbor node status information in communication networks. BACKGROUND
Multiprotocol Label Switching (MPLS) enables efficient delivery of a wide variety of differentiated, end to end services. Multiprotocol Label
Switching (MPLS) traffic engineering (TE) provides a mechanism for selecting efficient paths across an MPLS network based on bandwidth considerations and administrative rules. Each label switching router maintains a TE link state database with a current network topology. Once a path is computed, TE is used to maintain a forwarding state along that path.
In the case of deployment of MPLS Resource Reservation Protocol
(RSVP) Inter Domain Traffic Engineering Label Switched Paths (TE LSPs), RSVP HELLO messages are initially exchanged between RSVP-capable routers such that an RSVP neighbor relationship is established.
To efficiently detect a nodal failure or restart, the HELLO messages are exchanged at a fairly regular interval on a per-neighbor basis. Having multiple interfaces/neighbors increases the number of HELLO messages that need to be exchanged, resulting in a significant control plane overhead. This control plane overhead is reduced by reducing the interval between HELLO message exchanges. However, this increased interval may result in a delayed failover (resulting in dropped traffic) or a delay in recognizing that an apparently failed node is back in operation (resulting in inefficient use of the restored node).
Within the context of some Point to Multi-Point (P2MP) Networks, various Border Gateway Protocol (BGP) extensions and procedures allow the use of Bidirectional Forwarding Detection (BFD) to provide fast detection and failover for upstream faults such as neighboring node failure. However, if an apparent neighboring node failure is simply a restart of the neighboring node, the propagation of upstream fault information will unnecessarily result in the removal of the restarting node from service for an extended period of time.
SUMMARY
Various deficiencies in the prior art are addressed by systems, methods and apparatus adapting one or more routers or nodes in a network to operate in a first mode to exchange hello messages with neighboring nodes to indicate thereby active or live status, and to operate in a second mode to avoid the use of hello messages by opportunistically relying upon service or management protocols to convey active or live status.
A method according to one embodiment comprises establishing a neighboring node relationship with one or more neighboring nodes using
Resource Reservation Protocol (RSVP) HELLO message exchange; in a first mode of operation with respect to a neighboring node, using HELLO messages to determine that the neighboring node is in a failed state; and in a second mode of operation with respect to a neighboring node, using a Bi- directional Forwarding Detection (BFD) mechanism to determine that the neighboring node is in a failed state, the second mode of operation entered in response to HELLO suppression active indicia received from the neighboring node. In various embodiments, in response to the use of a Bi-directional Forwarding Detection (BFD) mechanism, HELLO suppression active indicia are transmitted toward one or more upstream neighboring nodes. BRIEF DESCRIPTION OF THE DRAWINGS
The teachings of the present invention can be readily understood by considering the following detailed description in conjunction with the accompanying drawings, in which:
FIG. 1 depicts an exemplary network benefiting from the various embodiments;
FIG. 2 depicts a flow diagram of a method according to one
embodiment;
FIG. 3 depicts a flow diagram of a method according to one
embodiment; and
FIG. 4 depicts a high-level block diagram of a computer suitable for use in performing various functions described herein.
To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures.
DETAILED DESCRIPTION
Various embodiments will be described within the context of a communication network including a plurality of routers or nodes operating in a first mode to exchange hello messages with neighboring nodes to indicate thereby active or live status, and in a second mode to avoid the use of hello messages by opportunistically relying upon service or management protocols to convey active or live status.
Advantageously, the various embodiments provide a very low latency mechanism or protocol adapted to detect faults in a bidirectional path between two forwarding engines, including interfaces, data link(s) and/or forwarding engines. The mechanism or protocol is generally operable independent of media, data protocols and routing protocols.
FIG. 1 depicts a high level block diagram of a communication network architecture benefiting from various embodiments. Specifically, the architecture 100 of FIG. 1 provides a Multi-Protocol Label Switching (MPLS) network supporting Resource Reservation Protocol (RSVP) Inter Domain Traffic Engineering Label Switched Paths (TE LSPs) of type Contiguous LSP. The network may be modified by those skilled in the art to use other MPLS related protocols rather that the exemplary protocol discussed herein.
The architecture 100 includes an IP/MPLS communication network
(CN) 105 and at least one network management system (NMS) 120. As depicted, NMS 120 is operative to control a plurality of routers 110 forming the CN 105. As depicted, the CN 105 comprises a plurality of Provider Edge (PE) routers 1 10-1 through 110-4, and a plurality of core routers 110-X1 and 110- X2. It will be noted that while only four PE routers are depicted, the CN 105 may include many more PE routers. Similarly, while only two core routers are depicted, the CN 105 may include many more core routers. The
representation of the CN 105 is simplified for purposes of this discussion.
The NMS 120 is a network management system adapted for performing the various management functions described herein. The NMS 120 is adapted to communicate with nodes of CN 105. The NMS 120 may also be adapted to communicate with other operations support systems (e.g., Element Management Systems (EMSs), Topology Management Systems (TMSs), and the like, as well as various combinations thereof).
The NMS 120 may be implemented at a network node, network operations center (NOC) or any other location capable of communication with the CN 105 and various elements related thereto. The NMS 120 may support user interface capabilities to enable one or more users to perform various network management, configuration, provisioning or control related functions (e.g., enter information, review information, initiate execution of various methods as described herein and the like). Various embodiments of the NMS 120 are adapted to perform functions as discussed herein with respect to the various embodiments. The NMS 120 may be implemented as a general purpose computing device or specific purpose computing device, such as described below with respect to FIG. 3. The NMS 120 and the various routers 110 operate to support Resource Reservation Protocol (RSVP) Inter Domain Traffic Engineering Label
Switched Paths (TE LSPs) of type Contiguous LSP, such as defined in in IETF Standards RFC4726 and RFC5151.
For purposes of the discussion it will be assumed that each directly connected router 1 10 establishes a neighboring node relationship with each other router 1 10 to which it is directly connected. Thus, each of the various routers 1 10 has associated with it a respective plurality of neighbor nodes. For example, each of the core routers 1 10-X1 and 1 10-X2 is depicted as being connected to each other as well as each of the PE routers 1 10-1 through 1 10- 4. Similarly, PE routers 1 10-1 and 1 10-2 are depicted as being connected to each other as well as core routers 1 10-X1 and 1 10-X2.
To efficiently detect a nodal failure or restart, the HELLO messages are exchanged between neighboring nodes at predetermined intervals. Failure to receive such a message within the predetermined interval is an indication of a failure of the neighboring node that should have sent the message.
As depicted in FIG. 1 , a point to multipoint (P2MP) traffic stream (e.g., a video or other data stream) is communicated from a source Customer Edge (CE) router 130-S to a destination CE router 130-D via one or both of primary and secondary label switched paths (LSPs); namely, primary path P and secondary path S. Primary path P originates at PE 1 10-1 , traverses the core of CN 105 and terminates at PE 1 10-3. Secondary path S originates at PE 1 10-2, traverses the core of CN 105 and terminates at PE 1 10-3.
Thus, PE 1 10-3 operates as a dual homed leaf node sourcing traffic from two independent P2MP trees; namely, a primary LSP tree originating at Root Node PE 1 10-1 and a secondary LSP tree originating at Root Node PE 1 10-2. The P2MP channels utilize Bidirectional Forwarding Detection (BFD) or similar mechanisms, such as provided in the various Border Gateway Protocol (BGP) and other extensions and procedures. In this manner, fast detection and failover for upstream faults such as neighboring node failure is provided. In various embodiments, one or more of the routers 110 are adapted to operate in a first (unsuppressed) mode of operation to establish neighboring node relationships and periodically exchange hello messages with
neighboring nodes to indicate thereby active or live status. In response to the establishment of a LSP utilizing a protocol including a BFD mechanism, one or more routers 110 are adapted to operate in a second (suppressed) mode of operation wherein active/live status of downstream neighboring nodes is determined using the BFD mechanism and the hello message exchange function is partially or fully suppressed.
The various embodiments discussed herein contemplate neighbor nodes opportunistically moving between the first and second mode of operation in response to network management requirements, BFD
mechanism activation/inactivation and the like.
FIG. 2 depicts a flow diagram of a method according to one
embodiment. Specifically, FIG. 2 depicts a method 200 for suppressing hello messages between neighboring nodes supporting a common LSP including a BFD mechanism. The method 200 is adapted for use some or all of a plurality of nodes within a communications network. As such, while the functionality of the method 200 will be described from the perspective of a single network node, it will be appreciated that each of a plurality of network nodes of the network may operate according to this functionality to achieve an
opportunistically adaptive hello message suppression mechanism.
At step 210, the network node or router establishes a neighboring node relationship with other directly connected nodes or routers. That is, each of the nodes within the network interacts with directly connected nodes to establish mutual neighboring node relationships. Referring to box 215, this relationship may be established using RSVP message exchanges and/or other message exchanges.
At step 220, the network node enters a first or normal mode of operation in which hello message suppression is not used. Referring to box 225, hello messages continue to be exchanged with neighbor nodes to determine neighbor node state and/or other information. Further, the network node monitors the various paths it supports to determine if a BFD mechanism is utilized therein. As noted herein, neighboring network nodes supporting a common path using BFD may rely upon the BFD mechanism to identify node or link failures such that hello message exchanges may be avoided.
At step 230, the network node enters a second or suppressed mode of operation with upstream or downstream neighboring nodes as conditions allow. These conditions include an active BFD mechanism on a commonly supported path between the neighboring nodes, as well as a capability and desire of both nodes to operate in a hello suppression mode. Referring to box 235, helio messages are no longer exchanged between the neighboring nodes and node failure is no longer determined according to helio messages (i.e., whether a message was received within a predetermined time period).
At step 240, a second (suppressed) mode of operation is exited with those upstream or downstream neighboring nodes when conditions do not allow this mode of operation. Referring to box 245, the second or suppressed mode of operation is exited in response to any of (1) detection of a node control plane failure; (2) link failure; (3) neighboring node graceful restart; (4) Restart_Cap Object Change; (5) a Hello Suppression disable message;
and/or other criteria/events. After exiting the second mode of operation, the network node returns to the first mode of operation upon restoration/restart of the neighboring node or link.
Various embodiments contemplate these operating modes between upstream/downstream neighboring nodes where a BFD mechanism exists to provide node or link failure information. Referring to FIG. 1, it can be seen that PE router 110-1 may enter into a suppressed mode of operation with respect to core router 110-X2 due to the BFD mechanism associated with the primary multicast path P. Similarly, PE router 1 10-1 may not enter into a suppressed mode of operation with respect to core router 110-X1 since a path associated with the BFD mechanism is not depicted as common to both routers. Various embodiments contemplate an operating mode wherein a node receiving HELLO suppression active indicia from a downstream neighboring node transmits corresponding HELLO suppression active indicia toward one or more upstream neighboring nodes associated with said downstream neighboring node. Associated upstream nodes may comprise nodes sharing a LSP with the downstream node.
By opportunistically relying upon service or management protocols such as BFD to convey active or live status, resources normally allocated to keep alive hello message exchanges may be conserved. When used within the context of a network comprising a very large number of network elements, this conservation may become quite substantial.
Various embodiments adapt node operation to accommodate additional situations such as the neighbor node undergoing a Graceful Restart. Specifically, while having BFD enabled between neighbor nodes is sufficient to detect control plane failure, various embodiments provide additional interaction between upstream/downstream neighboring nodes to address the circumstances associated with neighboring node graceful restart and other situations. This additional interaction is provided using a helio suppression mechanism in which a Hello_Suppress object is included within or associated with HELLO messages communicated between neighbor nodes.
Thus, in various embodiments, a hello suppression mechanism is invoked between neighbor nodes after a session including a BFD mechanism is established (e.g., a RSVP BFD session). In particular, in various
embodiments the hello suppression mechanism utilizes the Hello_Suppress object to communicate hello suppression enable/active, helio suppression disable/in active, hello suppression restore/modify and/or other information between neighboring nodes. Hello_Suppress Object In various embodiments a Hello_Suppress Object is carried in the HELLO messages only when Helio Suppression is enabled. For purposes of this discussion, it will be assumed that the format of the Hello_Suppress Object is provided as follows. However, those skilled in the art will readily appreciate that other and different formats may also be used to communicate the relevant information between neighboring nodes.
0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 3 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ j Length j Class- um ( 131 ) ί C-Type (1) j
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
1 Hello Suppress REQUEST | Hello Suppress ACK j +-+-+-+-÷-+-+-+-+-+-+-÷-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In particular, an exemplary Hello Suppress REQUEST has a length of 16 bits. If Helio Suppression is enabled on a node, the Hello Suppress REQUEST field will be set to (1 ). If Hello Suppression is enabled on a node but the RSVP BFD is down, the Hello Suppress REQUEST field will be set to (0).
Similarly, an exemplary Hello Suppress ACK as a length of 16 bits, if Hello Suppression is enabled on a node and a neighbor sends a Hello Suppress REQUEST, then the Hello Suppress ACK field will be set to (1). It is noted that the Hello Suppress ACK field will be set to (0) if the BFD session is down.
FIG.3 depicts a flow diagram of a method according to one embodiment. Specifically, FIG.3 depicts a method 300 for entering a hello message suppressing mode of operation with respect to neighboring nodes supporting a common LSP including a BFD mechanism. The method 300 is adapted for use some or all of a plurality of nodes within a communications network to provide thereby an adaptive hello message suppression mechanism. For purposes of this discussion, assume that a first node R1 is upstream from a second and neighboring node R2. Each of the nodes R1 and R2 comprise MPLS capable routers within an IP-MPLS cloud, with RSVP BFD and HELLO messages enabled. Referring to FIG.1 , first and second nodes R1 and R2 may respectively comprise, illustratively, PE router 1 10-1 and core router 1 10-X2.
After establishing an MPLS LSP tunnel between the neighbors, the RSVP neighboring node status is active and the nodes start exchanging HELLO messages.
In various embodiments, entering a Hello Suppression mode of operation involves a 3-way handshaking procedure between the two neighbors, such as described beiow with respect to the various steps.
At step 310, a network element such as upstream node R1 determines if RSVP BFD is up/active and if Hello Suppression is enabled. If both conditions are true, then upstream node R1 transmits toward downstream node R2 a HELLO suppression Request (REQ) message. Referring to box 315, the hello suppression REQ message includes a Hello_Suppress Object with a REQUEST field set to (1 ) and a ACK field set to (0). Other bit settings or states may also be used to indicate that a hello suppression mode is requested between the two neighboring nodes.
At step 320, a network element such as downstream node R2 receives the hello suppression R EQ message from upstream node R1 and determines if RSVP BFD is up/active and Hello Suppression is enabled. If both conditions are true, then node R2 responds to the message received from node R1 by transmitting toward node R1 a HELLO suppression acknowledgment (ACK) message. Referring to box 325, the heilo suppression ACK message includes a Hello_Suppress Object with the REQUEST and ACK fields both set to (1 ). Other bit settings or states may also be used to indicate that a requested hello suppression mode between the two neighboring nodes is acknowledged.
At step 330, node R1 responds to the ACK message received from node R2 by transmitting toward node R2 a HELLO message adapted to establish or confirm hello suppression mode between the two nodes.
Referring to box 335, the hello suppression establishment or confirmation message includes a Heilo_Suppress Object with the REQUEST and ACK fields both set to (1 ). Other bit settings or states may also be used to indicate that hello suppression mode between the two neighboring nodes is established or confirmed.
At step 340, after the initial handshake procedure described above with respect to steps 310-335, both nodes R1 and R2 enter a Hello Suppression mode of operation with respect to each other. Referring to box 345, each of the nodes stopped transmitting hello messages to the other node, each of the nodes stops determining node failure conditions in response to the absence of otherwise expected hello messages. Other actions may also be taken as discussed herein. During this suppression mode of operation, the BFD mechanism is exclusively used to determine corresponding node or link failures.
The methods 200/300 described above with respect to FIGS. 2 and 3 contemplate opportunistically entering and exiting a hello suppression mode at one or more of a plurality of network elements. In particular, in various embodiments, the nodes will exit the Hello Suppression mode in response to (1 ) detection of a node control plane failure; (2) link failure; (3) neighboring node graceful restart; (4) Restart_Cap Object Change; (5) and/or a Hello Suppression disable message, illustratively as follows.
(1 ) A node control plane failure at node R2 will be detected at node R1 via the BFD mechanism. Node R1 will then invoke the currently used neighbor down procedures. When the RSVP control plane comes up on node R2, it will start sending HELLO messages again. The REQUEST field will be set to (1 ) only after node R2 detects that the RSVP BFD session has come up. The ACK field will be set to (0). The 3-way handshaking procedure described above will be used by the nodes to re-enter the Hello Suppression Phase. Values of the source and destination instances in the HELLO messages may be adapted according to, illustratively, the procedures described in IETF RFC 3209.
(2) A link failure between R1 and R2 will be detected on both the nodes via the BFD mechanism. On detecting the failure, both nodes will invoke the currently used neighbor down procedures. When the link comes up between the nodes, the 3-way handshaking procedure will be invoked once the RSVP BFD session is up. Values of the source and destination instances in the HELLO messages may be adapted according to, illustratively, the procedures described in IETF RFC 3209.
(3) After a restart of node R2 in which Graceful Restart is enabled, node R2 will send a HELLO message to node R1 including a Restart_Cap object. Nodes R1 and R2 will continue exchanging HELLO messages during the Restart Phases with the Hello_Suppress Object REQUEST and ACK fields set to (0).
On detecting completion of the Graceful Restart Phase, the nodes set their Hello_Suppress Object REQUEST field to (1 ) and the ACK field to (0). The nodes will then enter the 3-way handshaking phase to re-enter the Hello Suppression mode.
(4) After a restart of node R2 in which Graceful Restart is not enabled, node R2 will send a HELLO message to node R1 not including a Restart_Cap object. If R1 and R2 and already entered the Hello Suppression mode and Graceful Restart is enabled on node R1 , then R1 will start re-sending the HELLO messages. The HELLO messages will carry the Restart_Cap Object as described in RFC 3473 and the Hello_Suppress Object with the REQUEST field set to (1 ) and ACK field set to (0).
The nodes may then re-enter the Hello Suppression Phase after the initial handshaking procedure. Generally speaking, the nodes should exit the Hello Suppression Phase as described above any time there is a change in the Restart_Cap Object.
(5) An explicit command to disable or exit hello suppression mode may be generated by a network manager, a particular node, a service provider or any other source given such authority. In response to receiving a hello suppression mode disable/exit command or message, node R1 (illustratively) will stop sending HELLO messages with the Helio_Suppress Object, and node R2 will start sending HELLO messages with the REQUEST field set to (1 ) and the ACK field set to (0). Similarly, upon enabling Hello Suppression on node R1 , the nodes will re-enter the Suppression Phase after the 3-way handshaking process described above.
In various embodiments of the invention, rather than fully suppressing HELLO message exchanges the time interval within which failure to receive a HELLO message is indicative of a failed neighboring node is revised to a longer time interval. Revised time interval embodiments advantageously provide a mechanism for identifying neighboring node failure where failure of a relied upon BFD mechanism has occurred.
In various embodiments, the existing time interval is multiplied or increased by some factor to provide a revised time interval. In various embodiments, the revised time interval is specified directly. Data indicative of the revised time interval may be included within the various HELLO suppression indicia described herein.
Revised time interval embodiments operate in substantially the same manner as described above with respect to the various figures. One difference is that the method 200 of figure 2 is modified in that the second (suppressed) mode of operation is also exited at 240 (referring to box 245) in response to a failure to receive a HELLO message within a revised time interval. Simiiarly, the method 300 of figure 3 is modified in that the HELLO suppression mode of operation at step 340 further contemplates transmitting HELLO messages according to a revised interval schedule.
FIG. 4 depicts a high level block diagram of a computer suitable for use in performing functions described herein.
As depicted in FIG. 4, computer 400 includes a processor element 403 (e.g., a central processing unit (CPU) and/or other suitable processor(s)), a memory 404 (e.g., random access memory (RAM), read only memory (ROM), and the like), a cooperating module/process 405, and various input/output devices 406 (e.g., a user input device (such as a keyboard, a keypad, a mouse, and the like), a user output device (such as a display, a speaker, and the like), an input port, an output port, a receiver, a transmitter, and storage devices (e.g., a tape drive, a floppy drive, a hard disk drive, a compact disk drive, and the like)).
It will be appreciated that the functions depicted and described herein may be implemented in a combination of software and hardware, e.g., using a genera! purpose computer, one or more application specific integrated circuits (ASIC), and/or any other hardware equivalents, in one embodiment, the cooperating process 405 can be loaded into memory 404 and executed by processor 403 to implement the functions as discussed herein. Thus, cooperating process 405 (including associated data structures) can be stored on a computer readable storage medium, e.g., RAM memory, magnetic or optical drive or diskette, and the like.
It will be appreciated that computer 400 depicted in FIG. 4 provides a general architecture and functionality suitable for implementing functional elements described herein or portions network of the functional elements described herein.
It is contemplated that some of the steps discussed herein may be implemented within hardware, for example, as circuitry that cooperates with the processor to perform various method steps. Portions of the
functions/elements described herein may be implemented as a computer program product wherein computer instructions, when processed by a computer, adapt the operation of the computer such that the methods and/or techniques described herein are invoked or otherwise provided. Instructions for invoking the inventive methods may be stored in tangible and
non-transitory computer readable medium such as fixed or removable media or memory, and/or stored within a memory within a computing device operating according to the instructions. While the foregoing is directed to various embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof. As such, the appropriate scope of the invention is to be determined according to the claims.

Claims

What is claimed is:
1. A method for use at a network node, the method comprising: establishing a neighboring node relationship with one or more neighboring nodes using Resource Reservation Protocol (RSVP) HELLO message exchange;
in a first mode of operation with respect to a neighboring node, using HELLO messages to determine that the neighboring node is in a failed state; in a second mode of operation with respect to a neighboring node, using a Bi-directional Forwarding Detection (BFD) mechanism to determine that the neighboring node is in a failed state, said second mode of operation entered in response to HELLO suppression active indicia received from the neighboring node.
2. The method of claim 1, further comprising:
in response to the use of a Bi-directionai Forwarding Detection (BFD) mechanism, transmitting said HELLO suppression active indicia toward one or more upstream neighboring nodes.
3. The method of claim 2, further comprising:
in response to receiving sent HELLO suppression active indicia from a downstream neighboring node, transmitting said HELLO suppression active indicia toward one or more upstream neighboring nodes associated with said downstream neighboring node.
4. The method of claim 1 , wherein said HELLO suppression active indicia comprises inclusion of a Hello_Suppress object within a HELLO message, wherein said Hello_Suppress object is set to a first state to indicate a normal mode of operation and to a second state to indicate a suppressed mode of operation.
5. The method of claim 4, wherein said Hello_Suppress object includes data indicative of a revised time interval within which failure to receive a HELLO message is indicative of a failed neighboring node.
6. The method of claim 5, wherein said data indicative of a revised time interval comprises one of an existing time interval multiplier and a specific time interval.
7. The method of claim 1, further comprising entering said normal mode of operation with respect to said neighboring node in response to one of a cessation of use of said BFD mechanism by said neighboring node and HELLO suppression inactive indicia received from the neighboring node.
8. An apparatus, comprising a processor configured for:
establishing a neighboring node relationship with one or more neighboring nodes using Resource Reservation Protocol (RSVP) HELLO message exchange;
in a first mode of operation with respect to a neighboring node, using HELLO messages to determine that the neighboring node is in a failed state; in a second mode of operation with respect to a neighboring node, using a Bi-directional Forwarding Detection (BFD) mechanism to determine that the neighboring node is in a failed state, said second mode of operation entered in response to HELLO suppression active indicia received from the neighboring node.
9. A computer readable storage medium storing instructions which, when executed by a computer, adapt the operation of the computer to provide a method, comprising:
establishing a neighboring node relationship with one or more neighboring nodes using Resource Reservation Protocol (RSVP) HELLO message exchange; in a first mode of operation with respect to a neighboring node, using HELLO messages to determine that the neighboring node is in a failed state; in a second mode of operation with respect to a neighboring node, using a Bi-directional Forwarding Detection (BFD) mechanism to determine that the neighboring node is in a failed state, said second mode of operation entered in response to HELLO suppression active indicia received from the neighboring node.
10. A computer program product wherein computer instructions, when processed by a computer, adapt the operation of the computer to provide a method, comprising:
establishing a neighboring node relationship with one or more neighboring nodes using Resource Reservation Protocol (RSVP) HELLO message exchange;
in a first mode of operation with respect to a neighboring node, using
HELLO messages to determine that the neighboring node is in a failed state; in a second mode of operation with respect to a neighboring node, using a Bi-directional Forwarding Detection (BFD) mechanism to determine that the neighboring node is in a failed state, said second mode of operation entered in response to HELLO suppression active indicia received from the neighboring node.
PCT/US2013/050536 2012-07-27 2013-07-15 System and method using rsvp hello suppression for graceful restart capable neighbors WO2014018297A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP13742112.9A EP2878105B1 (en) 2012-07-27 2013-07-15 System and method using rsvp hello suppression for graceful restart capable neighbors
CN201380039529.8A CN104541482B (en) 2012-07-27 2013-07-15 The system and method suppressed for the neighbours with smooth restarting ability using RVSP HELLO
JP2015524313A JP6017037B6 (en) 2012-07-27 2013-07-15 System and method for using RSVP HELLO suppression for graceful restart capable neighbors
KR1020157002103A KR101652649B1 (en) 2012-07-27 2013-07-15 System and method using rsvp hello suppression for graceful restart capable neighbors

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US201261676796P 2012-07-27 2012-07-27
US61/676,796 2012-07-27
US13/722,152 US9294343B2 (en) 2012-07-27 2012-12-20 System and method using RSVP hello suppression for graceful restart capable neighbors
US13/722,152 2012-12-20

Publications (1)

Publication Number Publication Date
WO2014018297A1 true WO2014018297A1 (en) 2014-01-30

Family

ID=49994799

Family Applications (4)

Application Number Title Priority Date Filing Date
PCT/US2013/050536 WO2014018297A1 (en) 2012-07-27 2013-07-15 System and method using rsvp hello suppression for graceful restart capable neighbors
PCT/US2013/050510 WO2014018293A1 (en) 2012-07-27 2013-07-15 System, method and apparatus for signaling and responding to ero expansion failure in inter domain te lsp
PCT/US2013/051697 WO2014018541A1 (en) 2012-07-27 2013-07-23 System, method and apparatus conforming path cost criteria across multiple abrs
PCT/US2013/051793 WO2014018608A1 (en) 2012-07-27 2013-07-24 System and method for switching traffic from sub-optimal primary p2mp to standby p2mp

Family Applications After (3)

Application Number Title Priority Date Filing Date
PCT/US2013/050510 WO2014018293A1 (en) 2012-07-27 2013-07-15 System, method and apparatus for signaling and responding to ero expansion failure in inter domain te lsp
PCT/US2013/051697 WO2014018541A1 (en) 2012-07-27 2013-07-23 System, method and apparatus conforming path cost criteria across multiple abrs
PCT/US2013/051793 WO2014018608A1 (en) 2012-07-27 2013-07-24 System and method for switching traffic from sub-optimal primary p2mp to standby p2mp

Country Status (6)

Country Link
US (6) US9001672B2 (en)
EP (4) EP2878100B1 (en)
JP (2) JP2015527830A (en)
KR (4) KR101652649B1 (en)
CN (4) CN104541482B (en)
WO (4) WO2014018297A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016048850A (en) * 2014-08-27 2016-04-07 富士通株式会社 Packet transfer device, packet transfer system and packet transfer method

Families Citing this family (71)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9769016B2 (en) 2010-06-07 2017-09-19 Brocade Communications Systems, Inc. Advanced link tracking for virtual cluster switching
US8867552B2 (en) 2010-05-03 2014-10-21 Brocade Communications Systems, Inc. Virtual cluster switching
US9716672B2 (en) 2010-05-28 2017-07-25 Brocade Communications Systems, Inc. Distributed configuration management for virtual cluster switching
US9807031B2 (en) 2010-07-16 2017-10-31 Brocade Communications Systems, Inc. System and method for network configuration
US9450870B2 (en) 2011-11-10 2016-09-20 Brocade Communications Systems, Inc. System and method for flow management in software-defined networks
US9374301B2 (en) 2012-05-18 2016-06-21 Brocade Communications Systems, Inc. Network feedback in software-defined networks
US8948051B2 (en) * 2012-05-30 2015-02-03 Alcatel Lucent System and method for efficient MVPN source redundancy with S-PMSI
US9160652B2 (en) * 2012-08-31 2015-10-13 Cisco Technology, Inc. Fast reroute for bidirectional co-routed traffic engineering tunnels
US9401872B2 (en) 2012-11-16 2016-07-26 Brocade Communications Systems, Inc. Virtual link aggregations across multiple fabric switches
CN103067220B (en) * 2012-12-19 2016-02-10 中兴通讯股份有限公司 Two-way link forwarding detection (BFD) method and device under parameter update status
US9565099B2 (en) 2013-03-01 2017-02-07 Brocade Communications Systems, Inc. Spanning tree in fabric switches
US8953500B1 (en) * 2013-03-29 2015-02-10 Juniper Networks, Inc. Branch node-initiated point to multi-point label switched path signaling with centralized path computation
US9769058B2 (en) * 2013-05-17 2017-09-19 Ciena Corporation Resilient dual-homed data network hand-off
US9178812B2 (en) 2013-06-05 2015-11-03 Cisco Technology, Inc. Stacking metadata contexts for service chains
US9444675B2 (en) * 2013-06-07 2016-09-13 Cisco Technology, Inc. Determining the operations performed along a service path/service chain
US10708182B2 (en) * 2013-07-26 2020-07-07 Cisco Technology, Inc. MPLS LSP connectivity test when the initiator address is unknown
US9019814B1 (en) * 2013-08-05 2015-04-28 Juniper Networks, Inc. Fast failover in multi-homed ethernet virtual private networks
US9397931B1 (en) 2013-08-16 2016-07-19 Juniper Networks, Inc. Fast convergence in singly-homed ethernet virtual private networks
US9391885B1 (en) 2013-09-05 2016-07-12 Juniper Networks, Inc. MPLS label usage in Ethernet virtual private networks
US9178816B1 (en) 2013-09-27 2015-11-03 Juniper Networks, Inc. Control plane messaging in all-active multi-homed ethernet virtual private networks
US9912612B2 (en) 2013-10-28 2018-03-06 Brocade Communications Systems LLC Extended ethernet fabric switches
JP6253956B2 (en) * 2013-11-15 2017-12-27 株式会社日立製作所 Network management server and recovery method
US10020984B1 (en) * 2014-01-10 2018-07-10 Juniper Networks, Inc. RSVP local protection signaling reduction
US9548873B2 (en) 2014-02-10 2017-01-17 Brocade Communications Systems, Inc. Virtual extensible LAN tunnel keepalives
US10581758B2 (en) 2014-03-19 2020-03-03 Avago Technologies International Sales Pte. Limited Distributed hot standby links for vLAG
US10476698B2 (en) 2014-03-20 2019-11-12 Avago Technologies International Sales Pte. Limited Redundent virtual link aggregation group
CN104980295A (en) * 2014-04-09 2015-10-14 中兴通讯股份有限公司 Method, device and system for preventing network node from aging
US10063473B2 (en) 2014-04-30 2018-08-28 Brocade Communications Systems LLC Method and system for facilitating switch virtualization in a network of interconnected switches
US9800471B2 (en) 2014-05-13 2017-10-24 Brocade Communications Systems, Inc. Network extension groups of global VLANs in a fabric switch
US10616108B2 (en) 2014-07-29 2020-04-07 Avago Technologies International Sales Pte. Limited Scalable MAC address virtualization
US9807007B2 (en) 2014-08-11 2017-10-31 Brocade Communications Systems, Inc. Progressive MAC address learning
AU2015317790B2 (en) 2014-09-16 2019-06-13 Palo Alto Networks, Inc. Methods and systems for business intent driven policy based network traffic characterization, monitoring and control
US10200293B2 (en) * 2014-10-20 2019-02-05 Futurewei Technologies, Inc. Dynamically offloading flows from a service chain
CN105681190A (en) * 2014-11-21 2016-06-15 中兴通讯股份有限公司 Tunnel restraint information sending, receiving method and device
US9942097B2 (en) 2015-01-05 2018-04-10 Brocade Communications Systems LLC Power management in a network of interconnected switches
US10003552B2 (en) * 2015-01-05 2018-06-19 Brocade Communications Systems, Llc. Distributed bidirectional forwarding detection protocol (D-BFD) for cluster of interconnected switches
US10038592B2 (en) 2015-03-17 2018-07-31 Brocade Communications Systems LLC Identifier assignment to a new switch in a switch group
US10579406B2 (en) 2015-04-08 2020-03-03 Avago Technologies International Sales Pte. Limited Dynamic orchestration of overlay tunnels
CN106205628B (en) * 2015-05-06 2018-11-02 小米科技有限责任公司 Voice signal optimization method and device
CN106375353B (en) * 2015-07-20 2020-05-19 中兴通讯股份有限公司 Link establishment processing method and device
US10439929B2 (en) 2015-07-31 2019-10-08 Avago Technologies International Sales Pte. Limited Graceful recovery of a multicast-enabled switch
US10171303B2 (en) 2015-09-16 2019-01-01 Avago Technologies International Sales Pte. Limited IP-based interconnection of switches with a logical chassis
US10257074B1 (en) * 2015-09-30 2019-04-09 Juniper Networks, Inc. Avoiding multicast traffic loss in networks having multi-homing designated routers
US9860150B2 (en) * 2015-10-01 2018-01-02 Juniper Networks, Inc. Fast convergence of EVPN networks for multi homing topologies
US10438577B2 (en) * 2015-10-16 2019-10-08 Sony Corporation Information processing device and information processing system
US9853915B2 (en) * 2015-11-04 2017-12-26 Cisco Technology, Inc. Fast fail-over using tunnels
US9912614B2 (en) 2015-12-07 2018-03-06 Brocade Communications Systems LLC Interconnection of switches based on hierarchical overlay tunneling
US10104139B2 (en) * 2016-03-31 2018-10-16 Juniper Networks, Inc. Selectively signaling selective tunnels in multicast VPNs
CN107306197A (en) * 2016-04-20 2017-10-31 中兴通讯股份有限公司 A kind of method and device of protecting tunnel
CN106357541B (en) * 2016-09-09 2019-12-17 新华三技术有限公司 Information transmission method and device
CN109845199B (en) * 2016-09-12 2022-03-04 马维尔亚洲私人有限公司 Merging read requests in a network device architecture
US10237090B2 (en) 2016-10-28 2019-03-19 Avago Technologies International Sales Pte. Limited Rule-based network identifier mapping
US10129127B2 (en) * 2017-02-08 2018-11-13 Nanning Fugui Precision Industrial Co., Ltd. Software defined network controller, service function chaining system and trace tracking method
CN108574630B (en) * 2017-03-14 2020-06-02 华为技术有限公司 EVPN message processing method, device and system
US11115323B2 (en) * 2017-05-10 2021-09-07 Saudi Arabian Oil Company Securing Layer-3 virtual private network
EP3724761B1 (en) 2017-12-14 2021-04-28 Telefonaktiebolaget LM Ericsson (publ) Failure handling in a cloud environment
US11283672B2 (en) * 2018-05-25 2022-03-22 Juniper Networks, Inc. Forwarding detection of an aggregated interface
US20190379596A1 (en) * 2018-06-08 2019-12-12 Ciena Corporation Methods and Systems preventing Make Before Break failures during soft preemption in MPLS
CN109218107A (en) * 2018-10-15 2019-01-15 迈普通信技术股份有限公司 Link switch-over method, device, the network equipment and network system
US10771317B1 (en) * 2018-11-13 2020-09-08 Juniper Networks, Inc. Reducing traffic loss during link failure in an ethernet virtual private network multihoming topology
WO2020130785A1 (en) * 2018-12-18 2020-06-25 Mimos Berhad Method and node for network traffic management
CN109698781B (en) * 2018-12-20 2021-10-29 新华三技术有限公司 Management method of message forwarding path and PE (provider edge) equipment
US10833973B1 (en) * 2019-02-15 2020-11-10 Juniper Networks, Inc. Enabling selection of a bypass path from available paths in an open shortest path first (OSPF) domain and an intermediate system to intermediate system (ISIS) domain
US11785053B2 (en) * 2019-04-04 2023-10-10 Cisco Technology, Inc. Systems and methods for determining secure network paths
US11646956B2 (en) * 2019-07-24 2023-05-09 Cisco Technology, Inc. Systems and methods for providing bidirectional forwarding detection with performance routing measurements
CN110460520B (en) * 2019-08-26 2021-05-18 北京经纬恒润科技股份有限公司 Data message transmission method and whole vehicle network system
CN112558504B (en) * 2019-09-10 2021-11-02 中国电信股份有限公司 Method, device and system for forwarding critical path information based on OSPF protocol
CN113037622B (en) * 2019-12-24 2024-01-05 华为数字技术（苏州）有限公司 System and method for preventing BFD from vibrating
CN111565149B (en) * 2020-04-03 2022-04-08 烽火通信科技股份有限公司 Method and device for keeping remote session alive under LDP RLFA FRR scene
CN112039770B (en) * 2020-08-28 2022-08-05 北京世纪互联宽带数据中心有限公司 Routing method and device
CN114785732B (en) * 2022-05-05 2023-08-11 烽火通信科技股份有限公司 Method and system for P2MP multicast tunnel path protection

Family Cites Families (47)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7319700B1 (en) * 2000-12-29 2008-01-15 Juniper Networks, Inc. Communicating constraint information for determining a path subject to such constraints
US7436855B2 (en) * 2003-02-21 2008-10-14 Alcatel Lucent Prohibit or avoid route mechanism for path setup
US7899934B2 (en) 2003-03-31 2011-03-01 Symantec Corporation Handling un-partitioning of a computer network
CN100349406C (en) * 2003-06-22 2007-11-14 华为技术有限公司 A method for controlling establishment of label switch path (LSP) based on resource reservation protocol (RSVP)
US7680028B1 (en) * 2003-11-21 2010-03-16 Cisco Technology, Inc. Method and apparatus for restarting RSVP processes in multiple network devices
CN100372337C (en) * 2004-05-31 2008-02-27 华为技术有限公司 Route selection method for implementing cross-domain constraint-based routing
US8717899B2 (en) 2004-10-13 2014-05-06 Cisco Technology, Inc. System and method for reporting out-of-resources (OOR) conditions in a data network
US7496105B2 (en) * 2004-11-05 2009-02-24 Cisco Technology, Inc. System and method for retrieving computed paths from a path computation element using encrypted objects
JP4421458B2 (en) 2004-11-30 2010-02-24 三菱電機株式会社 Network node device and route information update method thereof
US8068411B2 (en) * 2004-12-29 2011-11-29 Cisco Technology, Inc. Method and apparatus to compute local repair paths taking into account link resources and attributes
CN1801802B (en) * 2004-12-31 2010-06-02 华为技术有限公司 Node restarting method on universal multi protocol label exchange path
US7602702B1 (en) 2005-02-10 2009-10-13 Juniper Networks, Inc Fast reroute of traffic associated with a point to multi-point network tunnel
US7616574B2 (en) 2005-03-15 2009-11-10 Cisco Technology, Inc. Dynamic retrieval of routing information for inter-AS TE-LSPs
CN100512287C (en) * 2005-07-21 2009-07-08 上海交通大学 Passive optical network system based on generalized multiprotocol label switching (GMPLS) protocol
US7995461B2 (en) 2005-08-24 2011-08-09 Cisco Technology, Inc. Efficient constrained shortest path first optimization technique
US7889669B2 (en) 2005-09-26 2011-02-15 Alcatel Lucent Equalized network latency for multi-player gaming
US7710872B2 (en) 2005-12-14 2010-05-04 Cisco Technology, Inc. Technique for enabling traffic engineering on CE-CE paths across a provider network
US7852778B1 (en) 2006-01-30 2010-12-14 Juniper Networks, Inc. Verification of network paths using two or more connectivity protocols
CN100403735C (en) * 2006-02-24 2008-07-16 华为技术有限公司 Method and system for realizing binding interface edge-to-edge pseudo wire simulation service
JP2007312091A (en) 2006-05-18 2007-11-29 Central Res Inst Of Electric Power Ind Routing apparatus and method for restoring fault
CN101087221B (en) * 2006-06-07 2010-12-08 华为技术有限公司 Resource reservation protocol node and its interaction method
US8199642B2 (en) * 2006-09-14 2012-06-12 Cisco Technology, Inc. Dynamically and efficiently forming hierarchical tunnels
JP5135748B2 (en) * 2006-09-27 2013-02-06 富士通株式会社 Transmission apparatus and path setting method
CN101212400B (en) 2006-12-25 2011-06-15 华为技术有限公司 Method and system for negotiating bidirectional forwarding detection session identifier for pseudo wire
CN101212456A (en) 2006-12-27 2008-07-02 华为技术有限公司 Method and device for avoiding label conflict in GMPLS controlled PBT
US8488444B2 (en) 2007-07-03 2013-07-16 Cisco Technology, Inc. Fast remote failure notification
CN101350761B (en) * 2007-07-18 2011-12-28 华为技术有限公司 Method, apparatus and system for establishing and calculating path
US8437272B2 (en) 2007-08-16 2013-05-07 Cisco Technology, Inc. Distinguishing between connectivity verification availability and forwarding protocol functionality in a computer network
JPWO2009078395A1 (en) 2007-12-17 2011-04-28 日本電気株式会社 Network system, node, control method, and program
US8531976B2 (en) 2008-03-07 2013-09-10 Cisco Technology, Inc. Locating tunnel failure based on next-next hop connectivity in a computer network
US7808919B2 (en) 2008-03-18 2010-10-05 Cisco Technology, Inc. Network monitoring using a proxy
US20100142531A1 (en) * 2008-12-01 2010-06-10 Samsung Electrics Co., Ltd. Method and system for enhancing routing in multiprotocol label switching (mpls)
US8014275B1 (en) 2008-12-15 2011-09-06 At&T Intellectual Property L, L.P. Devices, systems, and/or methods for monitoring IP network equipment
US8583832B2 (en) 2008-12-31 2013-11-12 Verizon Patent And Licensing Inc. Network interface device management using management transport channel
EP2476224B1 (en) * 2009-09-11 2014-10-08 Telefonaktiebolaget L M Ericsson (publ) Method and apparatus for path computation element and routing controller cooperation
US8339942B2 (en) 2009-10-15 2012-12-25 Telefonaktiebolaget L M Ericsson (Publ) RSVP-TE graceful restart under fast re-route conditions
WO2011045679A1 (en) 2009-10-15 2011-04-21 Telefonaktiebolaget L M Ericsson (Publ) Network connection segment monitoring
US8243587B2 (en) * 2009-10-22 2012-08-14 Verizon Business Global Llc Label distribution protocol synchronization in multi-protocol label switching environments
US8693339B2 (en) * 2009-12-10 2014-04-08 Verizon Patent And Licensing Inc. LDP extension for forwarding path congestion notification
US8705530B2 (en) 2010-07-29 2014-04-22 At&T Intellectual Property I, L.P. Methods and apparatus to implement multipoint and replicated communication paths using upstream and recursive downstream label mappings
US8451717B2 (en) 2010-07-30 2013-05-28 Alcatel Lucent Method and apparatus for rapid switchover from primary to standby multicast trees
US9231851B2 (en) 2011-01-31 2016-01-05 Futurewei Technologies, Inc. System and method for computing point-to-point label switched path crossing multiple domains
US8953590B1 (en) 2011-03-23 2015-02-10 Juniper Networks, Inc. Layer two virtual private network having control plane address learning supporting multi-homed customer networks
US20130232193A1 (en) 2012-03-04 2013-09-05 Zafar Ali Control-Plane Interface Between Layers in a Multilayer Network
US8997094B2 (en) 2012-06-29 2015-03-31 Pulse Secure, Llc Migrating virtual machines between computing devices
US8750310B2 (en) 2012-07-03 2014-06-10 Cisco Technology, Inc. Signaling co-routed and non co-routed LSPs of a bidirectional packet TE tunnel
US8902780B1 (en) 2012-09-26 2014-12-02 Juniper Networks, Inc. Forwarding detection for point-to-multipoint label switched paths

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KATZ D WARD JUNIPER NETWORKS D: "Bidirectional Forwarding Detection (BFD); rfc5880.txt", BIDIRECTIONAL FORWARDING DETECTION (BFD); RFC5880.TXT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARD, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GENEVA, SWITZERLAND, 1 June 2010 (2010-06-01), pages 1 - 49, XP015070820 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2016048850A (en) * 2014-08-27 2016-04-07 富士通株式会社 Packet transfer device, packet transfer system and packet transfer method

Also Published As

Publication number Publication date
EP2878107A1 (en) 2015-06-03
CN104541482A (en) 2015-04-22
JP5980427B2 (en) 2016-08-31
KR20150031317A (en) 2015-03-23
EP2878106A1 (en) 2015-06-03
JP6017037B2 (en) 2016-10-26
US20140029438A1 (en) 2014-01-30
US9294343B2 (en) 2016-03-22
JP2015527830A (en) 2015-09-17
EP2878105A1 (en) 2015-06-03
EP2878106B1 (en) 2020-02-19
US20140029413A1 (en) 2014-01-30
EP2878100A1 (en) 2015-06-03
EP2878105B1 (en) 2018-10-03
CN104737502A (en) 2015-06-24
CN104541482B (en) 2018-05-11
US9088485B2 (en) 2015-07-21
CN104737502B (en) 2017-06-23
JP6017036B2 (en) 2016-10-26
US9001672B2 (en) 2015-04-07
US9705735B2 (en) 2017-07-11
JP2015527824A (en) 2015-09-17
WO2014018541A1 (en) 2014-01-30
KR101652649B1 (en) 2016-08-30
KR20150036206A (en) 2015-04-07
US20160164720A1 (en) 2016-06-09
KR101628640B1 (en) 2016-06-08
US20140029418A1 (en) 2014-01-30
KR20150031316A (en) 2015-03-23
JP2015527831A (en) 2015-09-17
US9344325B2 (en) 2016-05-17
CN104541477A (en) 2015-04-22
WO2014018293A1 (en) 2014-01-30
US9491046B2 (en) 2016-11-08
CN104541477B (en) 2018-02-13
WO2014018608A1 (en) 2014-01-30
JP2015527825A (en) 2015-09-17
KR101685855B1 (en) 2016-12-12
CN104737506A (en) 2015-06-24
EP2878100B1 (en) 2019-04-10
US20140029414A1 (en) 2014-01-30
US20140029419A1 (en) 2014-01-30
KR20150037893A (en) 2015-04-08
CN104737506B (en) 2018-04-20

Similar Documents

Publication Publication Date Title
US9705735B2 (en) System and method using RSVP hello suppression for graceful restart capable neighbors
CN101170459B (en) Failure detection and link recovery method based on bidirectional forward link
US10250459B2 (en) Bandwidth on-demand services in multiple layer networks
US8331220B2 (en) Edge node redundant system
EP2667548B1 (en) Network traffic volume distribution method, network node, and system
US8902780B1 (en) Forwarding detection for point-to-multipoint label switched paths
US9059902B2 (en) Procedures, apparatuses, systems, and computer-readable media for operating primary and backup network elements
EP2360880B1 (en) Optimized fast re-route in MPLS-TP ring topologies
EP3342108B1 (en) Method and apparatus for supporting high availability
EP2996287A1 (en) Method for notifying information of pe device and pe device
WO2008098451A1 (en) Tunnel establishing method, network node device and network system
US8850062B2 (en) Distributed connectivity verification protocol redundancy
US20080002723A1 (en) Intelligent filtering of redundant data streams within computer networks
JP2015508631A (en) Redundant network connection
EP3029883B1 (en) Network protection method and apparatus, next-ring node, and system
WO2014012207A1 (en) Label switching path establishment method, data forwarding method and device
CN101465859A (en) Method and device for triggering main and standby interface board inverse switch
WO2018113294A1 (en) Method, device and system for forwarding packet
WO2012109860A1 (en) Method, device and system for establishing label switching path
WO2013029499A1 (en) Dynamic routing method
JP6017037B6 (en) System and method for using RSVP HELLO suppression for graceful restart capable neighbors
WO2022246693A1 (en) Method and apparatus for path switchover management
WO2010000172A1 (en) Method, system, receiving end device and multicast source device for multicast protection
Wu et al. Recovery from control plane failures in the RSVP-TE signaling protocol

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13742112

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 20157002103

Country of ref document: KR

Kind code of ref document: A

Ref document number: 2015524313

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2013742112

Country of ref document: EP