Juniper Networks, Inc.

Cisco Technology, Inc.

Junpier Networks, Inc.

Yakov Rekhter

Rahul Aggarwal

Raveendra Torvi

Harish Sitaraman

Chandrasekar Ramachandran

Markus Jork

Kireeti Kompella

Eric C Rosen

Anil Lohiya

Manoj Leelanivas

Ravi I Singh

Yimin Shen

Nischal Sheth

Ping Pan

Minjie Dai

Silvano Gai

Keith McCloghrie

Dino Farinacci

Natrajan Venkataraman

Santosh Esale

Wen Lin

John E Drake

John Galen Scudder

Rex Emmanuel Fernando

Hannes Gredler

Pedro R Marques

Ina Minei

Chaitanya Kodeboyina

Lili Wang

Vishnu Pavan Kumar Beeram

Sudharsana Venkataraman

Shivani Aggarwal

In one example, techniques of this disclosure may enable a point of local repair (PLR) network device to signal availability of link protection or node protection to a merge point (MP) network device and enable a network device to actively determine whether or not it is a merge point router. Based on whether or not the network device determines it is a MP, the network device may selectively clean up LSP states when there is an upstream link or node failure. The RSVP-TE protocol may be extended to enable a network device to send a tear down message to a downstream router, which may enable the downstream router to conditionally delete locale LSP state information. In some instances, a PLR network device may directly send a tear down message to a MP network device even though the PLR network device may not have a working bypass LSP.

Label switched path node failure management for label switched paths having refresh interval independent fast reroute facility protection

Techniques are described for establishing lower priority LSPs on paths determined to be less likely to include bandwidth constrained links. In one example, a router includes a plurality of physical interfaces each having at least one link interconnecting the router as one of a plurality of routers in a network and a processor. The processor is configured to determine whether a link of one of the plurality of physical interfaces is congested based at least in part on an amount of available bandwidth on the link, and, responsive to determining that the link is congested, set a bandwidth subscription for the link, wherein the bandwidth subscription specifies that the amount of available bandwidth on the link for label switched paths having a lower priority is less than the amount of available bandwidth on the link for label switched paths having a higher priority.

Label switched path preemption avoidance

Techniques are described for reusing downstream-assigned labels when establishing a new instance of a label switched path (LSP) prior to tearing down an existing instance of the LSP using make-before-break (MBB) procedures for RSVP. The techniques enable a routing engine of any non-ingress router along a path of the new LSP instance to reuse a previously allocated label for the existing LSP instance as the downstream assigned label for the new LSP instance when the paths of the existing LSP instance and the new LSP instance overlap. In this way, the non-ingress router does not need to update a label route in its forwarding plane for the reused label. When the new LSP instance completely overlaps the existing LSP instance, an ingress router of the LSP may avoid updating an ingress route in its forwarding plane for applications that use the LSP.

RSVP make-before-break label reuse

Establishing label switched paths having refresh interval independent fast reroute facility protection

Merge point determination in refresh interval independent fast reroute facility protection

Refresh interval independent fast reroute facility protection tear down messaging

The disclosed computer-implemented method for verifying the functionality of network paths may include (1) constructing, at a source node within a network, a test packet that uniquely identifies a network path whose functionality is unverified, (2) sending the test packet to a target node within the network via the network path in an attempt to verify the functionality of the network path, (3) receiving, back from the target node, the test packet sent to the target node via the network path, and then (4) verifying, at the source node, the functionality of the network path based at least in part on the test packet received back from the target node. Various other methods, systems, and computer-readable media are also disclosed.

System and method for verifying the functionality of network paths

In general, techniques are described for configuration of label switched paths in multi-protocol label switched networks. A router comprising a control unit and an interface may be configured to perform the techniques. The control unit may determine a label to bind to the LSP. The interface may transmit a message specifying the label that has been bound to the LSP prior to confirming that the LSP has been successfully configured within the support router to use the bound label.

Concurrent forwarding plane programming for multi-protocol label switched networks

In general, techniques are described for a path computation delay timer for multi-protocol label switched networks. As an example, an ingress network device configured to act as an ingress for a label switched path (LSP) may perform the techniques. The ingress network device comprises an interface and a processor. The interface may receive a message indicating an error along the LSP. The processor may delay an operation performed to configure a replacement LSP to be used in place of the LSP in order to provide time during which a cause of the error along the LSP is able to be determined. When the cause of the error is determined to be a failure of a network device supporting operation of the LSP, the processor may further perform the operation to configure the replacement LSP with the ingress network device such that the replacement LSP avoids the failed network device.

Path computation delay timer in multi-protocol label switched networks

Techniques are described for generating a No-Acknowledgement (NACK) message if the installation of a route for a label-switched path at a router has failed or is likely to fail. In some examples, a network device includes at least one processor and at least one module operable by the at least one processor to: receive a request to forward network packets for an LSP; responsive to receiving the request, initiate configuration of at least one forwarding unit of the network device to forward network packets for the LSP; generate a NACK message that indicates the at least one forwarding unit is not configured to forward the network packets for the LSP; and terminate based at least in part on the NACK message, the configuration of the at least one forwarding unit for the LSP.

Readiness detection for data plane configuration of label-switched paths

Techniques are described for providing fast reroute inter-area node protection for label switched paths (LSPs) using label distribution protocol (LDP). In one example, a network device may be configured to determine that a protected node is an area border router, and use network topology information, obtained by an Interior Gateway Protocol (IGP) executing on the network device, to identify a second area border router in the same IGP area as the protected node, to which to automatically establish a bypass LSP and a targeted LDP session.

Inter-area LDP node protection

Techniques are described for providing fast reroute intra-area node protection for label switched paths (LSPs) using label distribution protocol (LDP). In one example, a network device may be configured to use network topology information, obtained by an Interior Gateway Protocol (IGP) executing on the network device, to identify a next next hop merge point to which to automatically establish a bypass LSP, and to which to establish a targeted LDP session for obtaining a label advertised by the next next hop merge point.

Intra-area LDP node protection

Growing community of inventors

New Rochelle, NY, United States of America

Yakov Rekhter