Juniper Networks, Inc.

Kevin F Wang

Jaihari V Loganathan

Sanjay Khanna

Wen Lin

Kireeti Kompella

Ashutosh K Grewal

Jeffrey M Haas

Swamy Sadashivaiah Renu Kananda

Alex Varghese

Michal Styszynski

Tamas B Mondal

In some cases, once Fast Reroute (FRR) has taken place (e.g., for MPLS protection), a further FRR is undesirable, and even detrimental. A mechanism to prevent a further FRR, once such a further FRR is determined to be potentially harmful, is described.

Avoiding loops by preventing further fast reroute (FRR) after an earlier FRR

A network device may originate a route, and may designate the route as a first colored route having a first color. The network device may advertise the first colored route to a first intermediate network device to cause the first intermediate network device to propagate the first colored route to an ingress network device over a first colored border gateway protocol session. The network device may designate the route as a second colored route having a second color, and may advertise the second colored route to a second intermediate network device to cause the second intermediate network device to propagate the second colored route to the ingress network device over a second colored border gateway protocol session.

Providing border gateway protocol deterministic path forwarding

In general, various aspects of the techniques are described in this disclosure for distributed label assignment for labeled routes. In one example, a method includes obtaining, by a first thread of a plurality of execution threads for at least one routing protocol process executing on processing circuitry of a network device, an allocation of first labels drawn from a label space for a network service; adding, by the first thread, the first labels to a first local label pool for the first thread; generating, by the first thread, after obtaining the allocation of the first labels, a labeled route comprising a route for the network service and a label assigned by the first thread from the first local label pool; and outputting, by the network device, the labeled route.

Distributed label assignment for labeled routing protocol routes

A network device, associated with peer network devices, may receive policy information for a protocol; and compute a first update message based on information regarding a route associated with the policy information. The network device may determine that an upper utilization threshold for one or more of peer queues, associated with the peer network devices, is not satisfied; and write the first update message to the peer queues based on determining that the upper utilization threshold is not satisfied. The network device may compute a second update message based on the information regarding the route; determine that the upper utilization threshold for one or more of the peer queues is satisfied; and pause writing the second update message to the peer queues based on the upper utilization threshold being satisfied. The network device may permit the peer network devices to obtain data from corresponding ones of the peer queues.

Regulating enqueueing and dequeuing border gateway protocol (BGP) update messages

A method may include (1) identifying a set of prefixes that (A) facilitate forwarding traffic within a network and (B) are organized as a tree data structure in connection with a table stored on a network device, (2) identifying, in the set of prefixes organized as the tree data structure, a parent prefix and a child prefix that corresponds to the parent prefix, (3) determining that the parent prefix and the child prefix share a certain number of most-significant bits in common with one another, (4) determining that the parent prefix and the child prefix share a forwarding behavior in common with one another and then, in response to determining that the parent prefix and the child prefix share the certain number of most-significant bits and the forwarding behavior in common with one another, (5) compressing the table stored on the network device by merging the child prefix with the parent prefix within the table. Various other apparatuses, systems, and methods are also disclosed.

Apparatus, system, and method for optimizing forwarding information bases on network devices

In general, the disclosure describes techniques for distributing processing of routes among multiple execution threads of a network device. In some examples, a method includes identifying, with a thread of a plurality of execution threads, a first route processing thread of the execution threads to process a first route of a routing protocol, the first route received by the network device; identifying, with the thread, a second route processing thread of the execution threads to process a second route of a routing protocol, the second route received by the network device; processing, by the first route processing thread executing on a first core of the plurality of processing cores, the first route; and processing, by the second route processing thread executing on a second core at least partially concurrently with the first route processing thread executing on the first core of the plurality of processing cores, the second route.

Growing community of inventors

Sunnyvale, CA, United States of America

Kevin F Wang