Juniper Networks, Inc.

Cisco Technology, Inc.

Jonathan C Barth

Tarek Saad

Vishnu Pavan Beeram

Srihari Ramachandra Sangli

Raveendra Torvi

Chandrasekar Ramachandran

Sudhir Cheruathur

David Charles Wood

Sunanda L Kommula

Kireeti Kompella

Shraddha Hegde

Kaliraj Vairavakkalai

Vishnu Pavan Kumar Beeram

Xiaomin Wu

Andrew Judson Smith

David Delano Ward

Stefano Benedetto Previdi

Nitin Kumar

John Harper

Ian Michael Charles Shand

John E Drake

John Galen Scudder

Anthony Joseph Li

Ronald P Bonica

Babu Singarayan

Sandip Kumar Ghosh

William Britto Arimboor Joseph

Swamy Sadashivaiah Kananda

Anshu Verma

Sunanda Kommula

Antoni B Przygienda

David C Wood

A network device may receive an MPLS packet destined for a destination via a label-switched path (LSP), and may determine whether to apply a first special purpose label (SPL) option or a second SPL option for a label stack of the MPLS packet. The network device may apply, when the first SPL option is determined to be applied, one of a first type of the first SPL option for the label stack via a policy data indicator (PDI) and policy data (PD), or a second type of the first SPL option for the label stack via the PDI and the PD. The network device may forward the MPLS packet to a hop of the LSP based on the first type of the first SPL option or the second type of the first SPL option applied to the MPLS packet.

Encoding forwarding policy data in multiprotocol label switching (MPLS) labels

A first network device may create a port group for a plurality of links directly connected to a second network device, and may select the first network device as a controller network device and the second network device as a worker network device. The first network device may rank the plurality of links of the port group to generate a list of ranked links, and may select, from the list of ranked links, a highest ranked link as a control channel. The first network device may power off one or more of the plurality of links, except the control channel, based on one of a configuration, a policy, or a traffic prediction, and may identify a termination of a time period associated with powering off the one or more of the plurality of links. The first network device may power on the one or more of the plurality of links based on the termination of the time period.

Power optimization using dynamic bandwidth management between connected network devices

A disclosed computing device may include (1) a storage device configured to store a database that identifies states of nodes included in a network and (2) circuitry configured to (A) receive one or more packet fragments that account for at least one change made to a state of one of the nodes in a transaction, (B) identify, among the packet fragments, a transaction identifier corresponding to the transaction and an indication of a total number of packet fragments representing the transaction, and (C) update the database to account for the change upon ensuring receipt of all the packet fragments representing the transaction based at least in part on the transaction identifier and the indication. Various other devices, systems, and methods are also disclosed.

Devices, systems, and methods for updating remote databases via flooded packet fragments

The techniques describe network slicing in computer networks. For example, a node receives a slice policy definition. The slice policy definition comprising a slice selector to identify packets belonging to one or more network slices, referred to as a 'slice aggregate,' and one or more network resource requirements for the slice aggregate to meet one or more Service Level Objectives (SLOs). The node configures, based on the slice policy definition, a path for the slice aggregate that complies with the one or more network resource requirements. In response to receiving a packet, the node determines whether the packet is associated with the slice aggregate and, in response to determining that the packet is associated with the slice aggregate, forwards the packet along the path for the slice aggregate.

Network slicing including modeling, distribution, traffic engineering and maintenance

A controller at an IP (e.g., client) layer in a multi-layer network can request a network topology map from another controller at an optical (e.g., server) layer in the multi-layer network. The controller at the optical layer of the network can use a layer mapping function and common attributes between the formats used to describe the network topology map at the two layers to generate a common layer abstraction model representing the network topology map stored at the controller at the optical layer of the network. A controller-to-controller interface can translate and/or send the common layer abstraction model to the controller at the IP layer for processing data on the network.

Controller-to-controller interface for multi-layer network abstraction

A network device may receive a border gateway protocol (BGP) flow specification route associated with creation of an overlay network slice in a network, and may create a new routing instance based on the BGP flow specification route. The network device may associate interfaces defined by the BGP flow specification route with virtual private network (VPN) members, and may determine VPN parameters based on the BGP flow specification route. The network device may advertise the VPN parameters within the network to cause the network to generate the overlay network slice.

Dynamic creation of overlay network slices using border gateway protocol flow specifications

An ingress network device may receive a core domain network segment identifier associated with a core domain network of the multi-domain network. The ingress network device may receive location data of an egress network device associated with a second leaf domain network of the multi-domain network, wherein the location data may include data identifying the core domain network segment identifier, a second leaf domain network segment identifier associated with the second leaf domain network, and an egress network device segment identifier associated with the egress network device. The ingress network device may store the core domain network segment identifier and the location data, and may utilize the core domain segment identifier and the location data to route traffic to the egress network device.

Utilizing domain segment identifiers for inter-domain shortest path segment routing

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

This disclosure describes techniques for scaling resources that handle, participate, and/or control routing protocol sessions. In one example, this disclosure describes a method that includes instantiating a plurality of containerized routing protocol modules, each capable of storing routing information about a network having a plurality of routers; performing network address translation to enable each of the containerized routing protocol modules to communicate with each of the plurality of routers using a public address associated with the computing system; configuring each of the containerized routing protocol modules to peer with a different subset of the plurality of routers so that each of the containerized routing protocol modules share routing information with a respective different subset of the plurality of routers; and configuring each of the containerized routing protocol modules to peer with each other to share routing information received from the different subsets of the plurality of routers.

Scaling border gateway protocol services

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.

Growing community of inventors

Collegeville, PA, United States of America

Jonathan C Barth