Juniper Networks, Inc.

Harish Sitaraman

Chandrasekar Ramachandran

Raveendra Torvi

Yakov Rekhter

Markus Jork

Vishnu Pavan Beeram

Shraddha Hegde

Ravi I Singh

Kireeti Kompella

Nischal Sheth

Nitin Bahadur

Yimin Shen

Zhifang Zeng

Rahul Aggarwal

John E Drake

Hannes Gredler

Vishnu Pavan Kumar Beeram

Avneesh Sachdev

Minjie Dai

Sudharsana Venkataraman

Disha M Chopra

Ambrose Kwong

Chanrasekar Ramachandran

The disclosed computer-implemented method may include (1) receiving, at a network node within a network, a packet from another network node within the network, (2) identifying, within the packet, a label stack that includes a plurality of labels that collectively represent at least a portion of a label-switched path within the network, (3) popping, from the label stack, a label that corresponds to a next hop of the network node, (4) determining, based at least in part on the label, that the next hop has experienced a failure that prevents the packet from reaching a destination via the next hop, (5) identifying a backup path that merges with the label-switched path at a next-to-next hop included in the label-switched path, and then (6) forwarding the packet to the next-to-next hop via the backup path. Various other methods, systems, and apparatuses are also disclosed.

Apparatus, system, and method for providing node protection across label-switched paths that share labels

A first device may receive a packet that includes information identifying a path through a network. The first device may configure a header of the packet to include a first set of identifiers that identifies the path and the first device via which the packet was received. The first device may configure the header of the packet to include a second set of identifiers that identifies a set of devices associated with the path. The set of devices may be associated with providing the packet via a network. The first device may determine whether a counter associated with the first set of identifiers has been initialized. The first device may modify a value of the counter to record a metric. The first device may provide the packet to a second device. The first device may perform an action related to the packet or based on the value of the counter.

Per path and per link traffic accounting

The disclosed computer-implemented method may include (1) receiving, at a network node within a network, a packet from another network node within the network, (2) identifying, within the packet, a label stack that includes a plurality of labels that collectively represent at least a portion of an LSP within the network, (3) popping, from the label stack, a label that corresponds to a specific link to a further network node, and then upon popping the label from the label stack, (4) forwarding the packet to the further network node by way of the specific link. Various other methods, systems, and apparatuses are also disclosed.

Apparatus, system, and method for sharing labels across label-switched paths within networks

In general, techniques described are for providing graceful restart procedures for network devices of label switched paths (LSPs) implemented with label stacks. For example, a restarting network device may include a processor coupled to a memory that executes software configured to: receive a path signaling message including a recovery object that defines a reverse path of the LSP from an egress network device of the LSP to the restarting network device, including at least an upstream label and a downstream label associated with the restarting network device; determine, based on the recovery object, the upstream label and the downstream label associated with the restarting network device; and instantiate a control plane state of the restarting network device based on the recovery object.

Graceful restart procedures for label switched paths with label stacks

The disclosed system may include (1) receiving, at an ingress node within a network, a request to forward a packet along a label-switched path to an egress node within the network, (2) identifying a limit on the number of labels that the ingress node is capable of forwarding within a label stack of the packet, (3) determining that the number of hops within the label-switched path exceeds the limit on the number of labels that the ingress node is capable of forwarding, (4) selecting at least one of the hops within the label-switched path to act as a delegation node that imposes, onto the label stack of the packet, at least one label corresponding to a downstream hop within the label-switched path and (5) forwarding the packet from the ingress node to the delegation node to enable the delegation node to impose the label onto the label stack.

Apparatus, system, and method for imposing label stack entries on MPLs packets

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

In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization. Path computation elements may thus rely on an accurate TED for LSP path computation.

Bandwidth management for resource reservation protocol LSPS and non-resource reservation protocol LSPS

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

Growing community of inventors

Cupertino, CA, United States of America

Harish Sitaraman