Juniper Networks, Inc.

Chandrasekar Ramachandran

Harish Sitaraman

Raveendra Torvi

Vishnu Pavan Beeram

Yakov Rekhter

Markus Jork

Jonathan C Barth

Srihari Ramachandra Sangli

Kireeti Kompella

Kaliraj Vairavakkalai

Santosh Pallagatti Kotrabasappa

Vikas Ganapati Hegde

Sudharsana Venkataraman

Tarek Saad

Balaji Rajagopalan

Vishnu Pavan Kumar Beeram

Shraddha Hegde

John E Drake

Hannes Gredler

Ravi I Singh

Yimin Shen

Jeyananth Minto Jeganathan

Minjie Dai

Swamy Sadashivaiah Kananda

A network device may receive an MPLS packet destined for a destination via a label-switched path (LSP), and may determine whether to apply a first special purpose label (SPL) option or a second SPL option for a label stack of the MPLS packet. The network device may apply, when the first SPL option is determined to be applied, one of a first type of the first SPL option for the label stack via a policy data indicator (PDI) and policy data (PD), or a second type of the first SPL option for the label stack via the PDI and the PD. The network device may forward the MPLS packet to a hop of the LSP based on the first type of the first SPL option or the second type of the first SPL option applied to the MPLS packet.

Encoding forwarding policy data in multiprotocol label switching (MPLS) labels

The techniques describe network slicing in computer networks. For example, a node receives a slice policy definition. The slice policy definition comprising a slice selector to identify packets belonging to one or more network slices, referred to as a 'slice aggregate,' and one or more network resource requirements for the slice aggregate to meet one or more Service Level Objectives (SLOs). The node configures, based on the slice policy definition, a path for the slice aggregate that complies with the one or more network resource requirements. In response to receiving a packet, the node determines whether the packet is associated with the slice aggregate and, in response to determining that the packet is associated with the slice aggregate, forwards the packet along the path for the slice aggregate.

Network slicing including modeling, distribution, traffic engineering and maintenance

The problem of bandwidth insufficiency within an Intermediate System-to-Intermediate System (IS-IS) flood reflection (FR) cluster, and its associated problem(s) of increased signaling failures (and increased crank-bank signaling attempts, also referred to as 'signaling churn') when traffic engineered (TE) paths are computed, is avoided by signaling a more realistic “available bandwidth” advertisement on the FR TE links.

Bandwidth advertisement for floor reflector (FR) traffic engineering (TE) links

In some implementations, a non-ingress node of one or more label-switched paths (LSPs) may identify a resource issue event. The non-ingress node may identify, based on identifying the resource issue event, one or more notification-requester stacks included in a data structure. The non-ingress node may generate one or more resource notification messages that each include a respective notification-requester stack of the one or more notification-requester stacks. The non-ingress node may send the one or more resource notification messages based on the one or more notification-requester stacks.

Resource reservation protocol resource notification messages

A network device may receive a border gateway protocol (BGP) flow specification route associated with creation of an overlay network slice in a network, and may create a new routing instance based on the BGP flow specification route. The network device may associate interfaces defined by the BGP flow specification route with virtual private network (VPN) members, and may determine VPN parameters based on the BGP flow specification route. The network device may advertise the VPN parameters within the network to cause the network to generate the overlay network slice.

Dynamic creation of overlay network slices using border gateway protocol flow specifications

In some implementations, a head Level 2 (L2) node of an intermediate system-intermediate system (IS-IS) flood reflection (FR) network may determine an end-to-end path from the head L2 node to a tail L2 node of the IS-IS FR network. The IS-IS FR network includes a plurality of L2 nodes and a plurality of FR clusters that each comprise a plurality of Level 1 (L1) nodes and a plurality of L1 and L2 (L1/L2) nodes connected by a plurality of L1 links. The head L2 node may send information associated with the end-to-end path to another node identified in the end-to-end path to cause a label switched path (LSP) to be established from the head L2 node to the tail L2 node, wherein the LSP traverses one or more L1 links within an FR cluster of the IS-IS FR network.

Resource reservation protocol with traffic engineering path computation across intermediate system—intermediate system flood reflector clusters

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

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

A device may receive a set of border gateway protocol labels via a set of corresponding border gateway protocol messages. A border gateway protocol label, of the set of border gateway protocol labels, may be associated with a label descriptor attribute. The label descriptor attribute being associated with providing information regarding a forwarding semantic associated with the border gateway protocol label. The device may select the border gateway protocol label for routing network traffic toward a network device associated with the border gateway protocol label based on the label descriptor attribute. The device may route the network traffic toward the network device based on the border gateway protocol label and after selecting the border gateway protocol label.

Semantic information for labels in border gateway protocol

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.

Growing community of inventors

Bengaluru, India

Chandrasekar Ramachandran