Juniper Networks, Inc.

Hiren Bhalchandra Dave

Nischal Singh

Ashok Patrick Jude Manoharan

Vikram Rautela

Vikram P Rautela

In this disclosure, in a network comprising a plurality of network devices, a network device includes processing circuitry configured to: receive packet data corresponding to a network flow originating at a first device, the packet data destined to a second device; generate an entropy label to add to a label stack of the packet data, wherein the entropy label is generated from one or more attributes corresponding to the network flow that originated at the first device and is destined to the second device; generate a flow record including the entropy label, wherein the entropy label identifies the network flow amongst a plurality of network flows in the network; and send, to a controller of the network, the flow record, wherein the controller identifies the flow record based on the entropy label corresponding to the network flow originating at the first device and is destined to the second device.

End-to-end flow monitoring in a computer network

The disclosed computer-implemented method may include (1) receiving, at a network device, a route update for one or more routes that direct traffic within a network that supports BGP, (2) identifying, within the route update, a BGP prefix and a plurality of protocol next-hop addresses that (A) identify a plurality of neighbors of the network device and (B) each correspond to the BGP prefix, (3) maintaining a single copy of the BGP prefix and each of the protocol next-hop addresses, (4) receiving a packet destined for a computing device that is reachable via at least one of the neighbors of the network device, and then (5) forwarding the packet to the one of the neighbors of the network device in accordance with the BGP prefix and the protocol next-hop address that identifies the one of the neighbors. Various other methods, systems, and apparatuses are also disclosed.

Apparatus, system, and method for improved memory consumption in network devices via efficient route management

An enhanced, flooding-based routing protocol is described that provides label switched path session information. In one example, a transit router is intermediately positioned between at least two label edge routers. The transit router is configured to determine a maximum number of LSPs concurrently supported by the transit router and determine a number of LSPs concurrently established by the transit router and for which the transit router is responsible for switching packets to one or more of the two label edge routers. The transit router generates, in accordance with a link state routing protocol, a link state routing protocol message that specifies the LSP session information as the maximum number of LSP and the number of LSPs concurrently established. The transit router further transmits, to the label edge routers, the link state routing protocol message.

Flooding-based routing protocol having label switched path session information

A device may configure a dynamic set of bypass label-switched paths (LSPs), to protect one or more protected LSPs, based on configuration information. The dynamic set of bypass LSPs may be initially configured to include zero or more bypass LSPs. The configuration information may indicate a first condition for adding a bypass LSP to the dynamic set of bypass LSPs, and a second condition for removing a bypass LSP from the dynamic set of bypass LSPs. The device may determine that a network traffic condition, associated with the dynamic set of bypass LSPs, is satisfied. The device may modify the dynamic set of bypass LSPs to add, remove, or reconfigure one or more bypass LSPs based on determining that the network traffic condition is satisfied.

Growing community of inventors

Fremont, CA, United States of America

Hiren Bhalchandra Dave