Juniper Networks, Inc.

Future Wei Technologies, Inc.

Raveendra Torvi

Vishnu Pavan Beeram

Tarek Saad

Harish Sitaraman

Yakov Rekhter

Chandrasekar Ramachandran

Kireeti Kompella

Alia Karin Atlas

Markus Jork

Yimin Shen

Abhishek Deshmukh

Jonathan C Barth

Ravi I Singh

Maruthi Kishore Tiruveedhula

Santosh Esale

Minjie Dai

Vishnu Pavan Kumar Beeram

Sudharsana Venkataraman

Ronald P Bonica

Huaimo Chen

Manish P Gupta

John E Drake

Qianglin Quintin Zhao

Ina Minei

Ajay Kachrani

Hua Autumn Liu

Manish Talwar

Dmitry A Shokarev

Manikandan Musuvathi Poornachary

Natrajan Venkataraman

Christopher Bowers

Venkata Naga Chaitanya Munukutla

Shivam Vaid

Shraddha Hegde

Ross W Callon

Ashish Kumar

Nitin Bahadur

Harmeet Singh

Jimmy Jose

Amit Arora

Nischal Singh

Srihari Ramachandra Sangli

Ronald Paul Folkes

Vasudevan Navaneetha Krishnan

Dhiman Barman

Santosh S Easale

Navaneetha Krishnan V

Srikanth Venakta Gandiboyina

Devang Patel

In some implementations, an egress network device of a multiprotocol label switching (MPLS) network may exchange Internet key exchange (IKE) messages with an ingress network device of the MPLS network to establish a security association between the egress network device and the ingress network device. The egress network device may receive an MPLS packet that includes an MPLS header, a secure MPLS data header, and an MPLS payload. The egress network device may process the MPLS header to determine a label associated with a label-switched path (LSP) and a secure function indicator. The egress network device may decrypt, using a secure function identified based on the secure MPLS data header, the MPLS payload to generate a decrypted packet. The egress network device may transmit the decrypted packet towards a destination device.

Securing multiprotocol label switching (MPLS) payloads

The same prefix segment identifier (SID) may be configured and/or used for either (A) more than one prefix within an interior gateway protocol (IGP) domain, or (B) one prefix with more than one path computation algorithm within the IGP domain by: (a) receiving, by a node in the IGP domain, an IGP advertisement including both (1) a prefix SID and a segment routing global block (SRGB) slice identifier; (b) determining whether or not the SRGB slice identified by the SRGB slice identifier is provisioned on the node; and (c) responsive to a determination that the SRGB slice identified by the SRGB slice identifier is not provisioned on the node, not processing the prefix SID included in the received IGP advertisement, and otherwise responsive to a determination that the SRGB slice identified by the SRGB slice identifier is provisioned on the node, (1) processing the prefix SID and SRGB slice to generate a unique, per SRGB slice, MPLS label for the prefix, and (2) updating a label forwarding information base (LFIB) for the node using the unique, per SRGB slice, label for the prefix and the prefix.

Using and processing per slice segment identifiers in a network employing segment routing

A ring node N belonging to a resilient MPLS ring (RMR) provisions and/or configures clockwise (CW) and anti-clockwise (AC) paths on the RMR by: (a) configuring two ring node segment identifiers (Ring-SIDs) on the ring node, wherein a first of the two Ring-SIDs (CW-Ring-SID) is to reach N in a clockwise direction on the ring and a second of the two Ring-SIDs (AC-Ring-SID) is to reach N in an anti-clockwise direction on the ring, and wherein the CW-Ring-SID and AC-Ring-SID are unique within a source packet routing in networking (SPRING) domain including the ring; (b) generating a message including the ring node's CW-Ring-SID and AC-Ring-SID; and (c) advertising the message, via an interior gateway protocol, for receipt by other ring nodes belonging to the ring such that (1) a clockwise multipoint-to-point path (CWP) is defined such that every other one of the ring nodes belonging to the ring can be an ingress for the CWP and such that only the node is an egress for the CWP, and (2) an anti-clockwise multipoint-to-point path (ACP) is defined such that every other one of the ring nodes belonging to the ring can be an ingress for the ACP and such that only the node is an egress for the ACP.

Resilient multiprotocol label switching (MPLS) rings using segment routing

In some implementations, an ingress network device of a multiprotocol label switching (MPLS) network may receive a packet destined for a destination network device. The ingress network device may determine, based on the packet, a secure function to secure the packet and a label associated with a label-switched path (LSP) from the ingress network device to an egress network device of the MPLS network that is associated with the destination network device. The ingress network device may encrypt, using the secure function, the packet to generate an encrypted packet. The ingress network device may generate an MPLS packet comprising: an MPLS header that includes the label and a secure function indicator, a secure MPLS data header that includes information identifying the secure function, and an MPLS payload that includes the encrypted packet. The ingress network device may forward, based on the label, the MPLS packet.

An example network element includes one or more interfaces and a control unit, the control unit includes one or more processors configured to determine an egress network domain identifier (ID) and determine an abstracted interdomain network topology. The one or more processors are also configured to determine one or more interdomain paths from an abstracted ingress domain node to an abstracted egress domain node and determine whether an abstracted domain node is on the one or more interdomain paths. The one or more processors are configured to, based on the abstracted domain node being on the one or more interdomain paths, include one or more resources within a network domain in a filtered traffic engineering database (TED) and compute a path from an ingress node within the ingress network domain to an egress node within the egress network domain based on the filtered TED.

Filtering topologies for path computation in massively scaled networks

A disclosed 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 slice label that indicates a network slice that has been logically partitioned on the network, (3) determining a QoS policy that corresponds to the network slice indicated by the slice label, (4) applying the QoS policy to the packet, and then upon applying the QoS policy to the packet, (5) forwarding the packet to an additional network node within the network. Various other apparatuses, systems, and methods are also disclosed.

Apparatus, system, and method for steering traffic over network slices

In general, techniques are described for signaling IP path tunnels for traffic engineering using constraints in an IP network. For example, network devices, e.g., routers, of an IP network may compute an IP path using constraint information and establish the IP path using, for example, Resource Reservation Protocol, to signal the IP path without using MPLS. As one example, the egress router generates a path reservation signaling message that includes an egress IP address that is assigned for use by the routers on the IP path to send traffic of the data flow by encapsulating the traffic with the egress IP address and forwarding toward the egress router. As each router in the IP path receives the path reservation signaling message, the router configures a forwarding state to forward traffic encapsulated with the egress IP address to a next hop along the IP path toward the egress router.

Signaling IP path tunnels for traffic engineering

In general, this disclosure describes a network device to determine a cause of packets being dropped within a network. An example method includes generating, by a traffic monitor operating on a network device, an exception packet that includes a unique exception code that identifies a cause for a component in the network device to discard a transit packet, and a nexthop index identifying a forwarding path being taken by the transit packet experiencing the exception. The method also includes forwarding the exception packet to a collector to be processed.

Dropped packet detection and classification for networked devices

A tactical solution to network congestion is provided by a data forwarding device having (1) a first interface with a first link to a downstream data forwarding device and (2) second interface with a second link to a downstream data forwarding device, and executing a method comprising: (a) configuring the second interface as part of a loop-free alternate (LFA) path to a destination device, wherein the first interface is part of a shortest/preferred path to the destination device; (b) monitoring congestion at the first interface to determine whether or not the congestion exceeds a first threshold; and (c) responsive to a determination that the congestion exceeds the first threshold, forwarding at least some data addressed to the destination device, over the LFA path via the second interface instead of over the shortest/preferred path via the first interface, thereby alleviating congestion at the first interface, and otherwise, responsive to a determination that the congestion does not exceed the first threshold, not forwarding at least some data addressed to the destination device, over the LFA path via the second interface instead of over the shortest/preferred path via the first interface.

Distributed tactical traffic engineering (TE) using loop free alternative (LFA), remote-LFA (R-LFA) and/or topology independent-LFA (TI-LFA) secondary paths

Support is provided for flexible algorithms, used by the border gateway protocol (BGP) route selection process, in the context of segment routing (SR) Prefix segment identifiers (SIDS) advertised using BGP.

Flexible algorithm aware border gateway protocol (BGP) prefix segment routing identifiers (SIDs)

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 a label-switched path within the network, (3) popping, from the label stack, a label that corresponds to a next hop of the network node, (4) determining, based at least in part on the label, that the next hop has experienced a failure that prevents the packet from reaching a destination via the next hop, (5) identifying a backup path that merges with the label-switched path at a next-to-next hop included in the label-switched path, and then (6) forwarding the packet to the next-to-next hop via the backup path. Various other methods, systems, and apparatuses are also disclosed.

Apparatus, system, and method for providing node protection across label-switched paths that share labels

Growing community of inventors

Nashua, NH, United States of America

Raveendra Torvi