Juniper Networks, Inc.

Rajesh Shetty Manur

Shraddha Hegde

Ronald P Bonica

Sri Karthik Goud Gadela

Abhishek Chakraborty

Salih K A

Abhishek Asthana

Parag Kaneriya

Swamy Sadashivaiah Renu Kananda

William Britto Arimboor Joseph

Swamy Sadashivaiah Kananda

Joya Neema

Rajendra Prasad Bollam

Kiran Kushalad

Srihari Ramachandra Sangli

Bharath RadhaKrishna Bhat

Deepti Nirmalkumarji Rathi

Jagathpathi Dasararaju

Navaneeth Y V

A first network device may receive an advertisement that includes a prefix for a second network device, wherein the advertisement is destined for a third network device. The first network device may determine, based on a network topology, whether a next hop is one hop away or multiple hops away. The first network device may selectively modify the advertisement to include a first segment identifier, based on the next hop being one hop away and to generate a first modified advertisement, or may modify the advertisement to include a second segment identifier, based on the next hop being multiple hops away and to generate a second modified advertisement. The first network device may forward the first modified advertisement or the second modified advertisement toward the third network device.

Segment identifiers that support end-to-end segment routing with color extended community and border gateway protocol virtual private network option B

In some implementations, a first network device may receive an advertisement from a second network device. The advertisement may be associated with indicating that the second network device is configured to support a particular flex-algorithm. The first network device may identify, in the advertisement, an address of the second network device. The first network device may configure a routing table of the first network device to indicate that the second network device is capable of receiving traffic associated with the particular flex-algorithm based on the address. The first network device may perform, using the routing table, an action associated with routing the traffic associated with the particular flex-algorithm.

Configuration of a network using a flex-algorithm routing mechanism

Segment identifiers that support end-to-end segment routing with color extended community and border gateway protocol virtual private network option b

This disclosure describes techniques that include determining, at an egress node in an SRm6 network, how to process a packet that may arrive without a segment routing header and/or a compressed routing header. In one example, this disclosure describes a method that includes receiving, by an egress node of a segment routing network, segment routing advertisements; configuring, by the egress node and based on the segment routing advertisements, information enabling the egress node to recognize encapsulated packets arriving at the egress node without a compressed routing header; receiving, by the egress node, a packet that does not have a compressed routing header; and de-encapsulating, by the egress node and based on the stored information, the packet.

Processing a flow at the egress node in segment routing

A node may receive a network topology message that identifies a first association of a first segment identifier (SID), relating to a loosely routed segment of a network, and an address of a first terminal interface associated with the loosely routed segment, or a second association of a second SID, relating to a strictly routed segment of the network, and an address of a second terminal interface associated with the strictly routed segment. The node may generate an entry in a segment translation table based on the first association or the second association. The node may route, according to the segment translation table, an internet protocol (IP) payload packet that has been encapsulated using an IPv6 transport header that has been extended with a compressed routing header of variable length.

Compressed routing header information for networks

This disclosure describes techniques for using Operations, Administration, and Management (OAM) operations when routing packets using micro SIDs in segment routing. For example, a network device comprises one or more processors configured to: receive a packet; determine whether the packet is encapsulated with one or more micro segment identifiers (SIDs); in response to a determination that the packet is not encapsulated with one or more micro SIDs, determine whether the packet has reached a segment routing tunnel endpoint; and in response to a determination that the packet has reached the segment routing tunnel endpoint, initiate Operations, Administration, and Maintenance (OAM).

Micro SID packet processing with operations, administration, and management

A first network device may determine that a link-state database (LSDB), associated with the first network device, includes a first link-state advertisement (LSA) instance associated with a second network device. The first network device may determine that the first network device has not received a second LSA instance, associated with the second network device, that does not include information identifying a fully adjacent link between the second network device and the first network device. The first network device may receive the second LSA instance associated with the second network device and may transmit, to the second network device, a third LSA instance, associated with the first network device, that includes the information identifying the fully adjacent link between the second network device and the first network device, only after the second LSA instance is received.

Reducing open shortest path first protocol link flap

Multiple Register State Machines on a rendezvous point router ('RP') in a Protocol Independent Multicast-Sparse Mode ('PIM-SM') domain per (S,G) is supported, thereby increasing the Register state consistency and faster convergence in case of a first hop router (&#x201c;FHR&#x201d;) failure. Such example embodiments may advantageously eliminate the limitation of a single Register State Machine on RP for a given (S,G), in the presence of multiple FHRs connected to the same source. At least some such example embodiments provide the capability of maintaining multiple Register State Machines on RP for a given (S,G), in a way, that maps one Register State Machine to each FHR. In this way, the RP can avoid the inconsistent FHR states and traffic losses caused due to FHR failures.

Rendezvous point (RP) router with improved processing of first hop router (FHR) information in a protocol independent multicast (PIM) network domain

A first network device detects a link down event associated with a second network device, where the link down event is detected by the first network device prior to being detected by a third network device, and the second network device is a designated network device of a network. The first network device starts a delay timer before processing the link down event, and detects an event that includes at least one of receipt, from the third network device, of a link state advertisement message based on the link down event, or an expiration of the delay timer. The first network device determines the first network device to be a new designated network device for the network based on detecting the event, and provides, to the third network device, information indicating that the first network device is the new designated network device for the network.

Reducing traffic loss during network device failure in an open shortest path first (OSPF) protocol-based local area network

The potential problem of traffic loss during a period when a second PIM router is elected DR after a first PIM router (on the same PIM interface) was previously elected DR and is transiting multicast traffic, is solved by (1) configuring a first interval on a PIM interface for at least the first PIM router; (2) responsive to the PIM interface of the first PIM router booting up, (i) starting, by the first PIM router, a timer corresponding to the configured first interval, (ii) determining, by the first PIM router, whether or not it is the DR on the PIM interface, (iii) upon determining that the timer has expired, redetermining, by the first PIM router, whether or not it is the DR on the PIM interface, and (iv) responsive to a redetermination that the first PIM router is the DR on the PIM interface, (A) increasing, by the first PIM router, a DR priority value of the first PIM router to reduce a likelihood that another of the at least two PIM routers will replace the first PIM router as DR, and (B) sending on the PIM interface, by the first PIM router, a PIM HELLO message including the increased DR priority value.

Protocol independent multicast ('PIM') fault tolerant designated router ('DR') election

An example method includes receiving, by a first hop router (FHR) and from a source device, multicast stream data associated with a multicast stream, sending, from the FHR and to a rendezvous point (RP) using a Protocol Independent Multicast (PIM) protocol, one or more null register messages that are each associated with the multicast stream. Each of the one or more null register messages includes a source address and a group address that are collectively associated with the multicast stream, and each of the one or more null register messages further includes an indication to request that the RP refrain from sending any register-stop messages associated with the multicast stream to the FHR. The example method further includes, after sending the one or more null register messages that are each associated with the multicast stream, sending, to the RP, the multicast stream data in a non-encapsulated format.

Growing community of inventors

Bengaluru, India

Rajesh Shetty Manur