Juniper Networks, Inc.

Markus Jork

Yakov Rekhter

Chandrasekar Ramachandran

Harish Sitaraman

Raveendra Torvi

Abilash Menon

John M Peterson

Kireeti Kompella

Vishnu Pavan Beeram

Alia Karin Atlas

Yimin Shen

Abhishek Deshmukh

Natrajan Venkataraman

Minjie Dai

Tong Jiang

Chaohui Zhang

Pranav Kethe-Sai

Chanrasekar Ramachandran

Techniques are described for a router providing metric-based multi-hop path selection. For example, a first router of a plurality of routers receives a plurality of network performance metrics for a plurality of links interconnecting the plurality of routers. The plurality of links form a plurality of multi-hop paths through the plurality of routers to a service instance. The router determines, based on the plurality of network performance metrics for the plurality of links, an end-to-end performance of each of the plurality of multi-hop paths. The router selects a multi-hop path over which to forward traffic associated with the session based on the end-to-end performance of each of the plurality of multi-hop paths and one or more performance requirements for a service associated between a session between a client device and the service instance. The router forwards the traffic to the service instance along the selected multi-hop path.

Metric-based multi-hop path selection

Techniques are disclosed for promulgating service information and topology information in a network in a high availability manner. An example device is configured to create a first service and topology exchange protocol (STEP) document. The first STEP document includes service information and topology information. The example device is configured to send the first STEP document to a first STEP repository for forwarding to at least one subscribing network device. The example device is also configured to send the first STEP document to a second STEP repository for forwarding to the at least one subscribing network device.

Service and topology exchange protocol having client-driven active-active repositories with high availability

A network device is configured to associate a tenant of a plurality of tenants with a virtual routing and forwarding (VRF) instance of a plurality of VRF instances. The network device receives a packet comprising metadata specifying a tenant identifier for the tenant. The network device identifies, based on the tenant identifier specified by the metadata, the VRF instance associated with the tenant. The network device retrieves one or more routes from a routing information base (RIB) of the VRF instance associated with the tenant and forwards the packet toward a destination via the one or more routes.

Tenant-based mapping for virtual routing and forwarding

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 one example, a merge point network device (MP) receives a plurality of resource reservation request messages for establishing a plurality of label switched paths (LSPs), wherein each of the plurality of LSPs has a common point of local repair network device (PLR) and has the MP as a common MP, wherein each of the resource reservation request messages identifies a common bypass tunnel that extends between the PLR and the MP and avoids a protected resource. The MP stores an association between the bypass tunnel and each of the plurality of LSPs. The MP receives a single message to trigger creation at the merge point network device of backup LSP state information for all of the plurality of LSPs. In response to receiving the single message, the MP installs state information for all of the LSPs that correspond to the bypass tunnel according to the stored association.

RSVP local protection signaling reduction

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 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

Growing community of inventors

Andover, MA, United States of America

Markus Jork