Juniper Networks, Inc.

William Britto Arimboor Joseph

Shraddha Hegde

Ronald P Bonica

Rajesh Shetty Manur

Bharath RadhaKrishna Bhat

Parag Kaneriya

Tarek Saad

Jonathan C Barth

Vishnu Pavan Beeram

Alampoondi Eswaran Natarajan

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

In some implementations, a network device may identify a segment routing traffic engineering (SR-TE) algorithm supported by the network device. The network device may determine, based on identifying the SR-TE algorithm, an identification value associated with the network device. The network device may generate an advertisement packet that includes the identification value and information identifying the SR-TE algorithm. The network device may send the advertisement packet to another network device to cause the other network device to update a data structure to indicate that the network device supports the SR-TE algorithm and that the network device is associated with the identification value. The other network device may determine, using the SR-TE algorithm, a forwarding path for a data packet that indicates the network device as a hop in the forwarding path.

Supporting multiple segment routing traffic engineering algorithms

In general, various aspects of the techniques described in this disclosure provide a sequence number checksum for link state protocols. In one example, the disclosure describes an apparatus, such as a network device, having a control unit operative to obtain link state information describing links between pairs of the network devices in a network topology, the link state information being fragmented into a plurality of link state protocol (LSP) fragments; compute a sequence number checksum from sequence numbers of the link state protocol (LSP) fragments; receive an LSP data unit from another network device in the network; determine whether a sequence number checksum in the LSP data unit matches a sequence number checksum computed from the link state information; and configure a delay for processing the LSP data unit in response to determining a mismatch between the sequence number checksum of the LSP data unit and the sequence number checksum computed from the link state information.

Sequence number checksum for link state protocols

Techniques are described for advertising constraint-based path computation (e.g., flexible-algorithm) through a constrained network topology. For example, a network device comprises a memory and one or more programmable processors operably coupled to the memory, wherein the one or more programmable processors are configured to generate a packet including a segment identifier (SID) offset, wherein the SID offset is an offset value associated with the flexible-algorithm. The one or more programmable processors of the network device are also configured to send, to at least one other network device of the plurality of network devices, the SID offset to enable the at least one other network device to derive a node segment identifier for the at least one other network device to participate in the flexible-algorithm.

Enhanced flexible-algorithm definition

Techniques are disclosed for a link state routing protocol adjacency state machine. The adjacency state machine ensures that first and second logical links using different networking protocols are established on a single physical link between two network devices prior to indicating adjacency between the network devices. In some examples, the adjacency state machine determines that both the first and second links are active in response to determining that hello messages are generated by both network devices for both links. In some examples, the adjacency state machine determines that both the first and second logical links are active upon expiration of a predetermined time corresponding to a time required for a duplicate address detection (DAD) operation to complete. In some examples, the first and second logical links use Internet Protocol version 4 (IPv4) and Internet Protocol version 6 (IPv6), respectively.

Link state routing protocol adjacency state machine

In general, techniques are described for conflict resolution in source packet routing in networking. For example, a first router receives a first advertisement originated in a first Interior Gateway Protocol (IGP) level. The first advertisement specifies a first prefix and a segment identifier (SID). The first router also receives a second advertisement originated in a second IGP level of the network. The second advertisement specifies a second prefix and the SID. Based on the first advertisement and the second advertisement specifying the same SID and based on the first IGP level having less visibility than the second IGP level, the first router selects the SID to be associated with a route to the first prefix.

Conflict resolution in segment routing

Techniques are described for facilitating the inclusion of a non-flexible-algorithm router to be included in flexible-algorithm path computations. For example, a flexible-algorithm router advertises information associated with a non-flexible-algorithm router to other flexible-algorithm routers in the network such that the flexible-algorithm routers may include the non-flexible-algorithm router when computing a path based on flexible-algorithm. During path computation, if the router determines that its next-hop router is the non-flexible-algorithm router, the router may configure additional forwarding information to cause the router to steer traffic to the non-flexible-algorithm router.

Growing community of inventors

Bengaluru, India

William Britto Arimboor Joseph