Cisco Technology, Inc.

Huawei Technologies Co., Limited

Hewlett-packard Development Company, L.p.

Hewlett Packard Enterprise Development LP

Alvaro E Retana

Russell Ivan White

Yi Yang

James L Ng

David Anthony Cook

Abhay Kumar Roy

Madhavi Wunnava Chandra

Timothy M Gage

Alfred C Lindem, Iii

Donnie Van Savage

Steven Edward Moore

Sina Mirtorabi

Keyur Patel

Syed Khalid Raza

Yingzhen Qu

Renwei Li

Uma S Chunduri

Roque Gagliano

Russ White

Pascal Thubert

Carlos M Pignataro

Brian Eliot Weis

Toerless Eckert

Ian Michael Charles Shand

Vincent Jean Ribiere

Burjiz F Pithawala

David A Cook

Thuan Van Tran

Thomas David Berry

Stanley M Ratliff

Mihail L Sichitiu

Michael Barnes

Alan Patrick Sheridan

Madhavi W Chandra

Rajiv Asati

Stewart Frederick Bryant

Alexander Clemm

Mohamed Khalid

Lin Han

Steinthor Bjarnason

Pratima Pramod Sethi

Jimmy Philip Ervin

Michael H Behringer

Mosaddaq Hussain Turabi

Paul Wells

Sanjeev Debdutta Rampal

Bruce Eric Pinsky

John E Cavanaugh

David Andrew Sacerdote

Thang Tat Do

Ed Kern

Stan Ratliff

Yves Francis Eugene Hertoghs

Donald Slice

Jeffrey Vern Zwall

Hoe Trinh

Fabien Degouet

Alfred Iii Lindem

Roy Abhay

A method of establishing streams within a QUIC connection implemented by a first network device, comprising: transmitting a first open message through the QUIC connection to a second network device, the first open message identifying a protocol; receiving a second open message through the QUIC connection from the second network device in response to transmitting the first open message, the second open message identifying the protocol; and establishing a first stream between the first network device and the second network device within the QUIC connection for the protocol identified in the first open message and in the second open message.

Supporting multiple border gateway protocol (BGP) sessions using multiple QUIC streams

A method is performed by a network element (NE) in a network implementing an Interior Gateway Protocol (IGP). The method comprises generating a message comprising a header and data, wherein the header comprises a length of the data prior to compressing the data, a length of the data after compressing the data, and a compression identifier, compressing the data based on a compression scheme identified by the compression identifier to obtain compressed data, and forwarding a compressed message comprising the header and the compressed data to another NE in the network.

Compressed data transmissions in networks implementing interior gateway protocol

A method implemented by a network element (NE) in a network, comprising receiving, by the NE, an advertisement comprising preferred path route (PPR) information and backup PPR information, the PPR information describing a PPR between a source and a destination in the network, the backup PPR information describing a backup PPR between the source and the destination, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR, updating, by the NE, a local forwarding database to include the PPR information and the backup PPR information in association with a destination address of the destination, and transmitting, by the NE, a data packet based on the backup PPR information instead of the PPR information in response to an element on the PPR being unavailable due to a failure of an element along the PPR.

Explicit backups and fast re-route mechanisms for preferred path routes in a network

A method implemented by a network element (NE) in a network receiving, by the NE, an advertisement comprising preferred path route (PPR) information describing a path from an ingress NE to an egress NE in the network, the PPR information comprising a PPR identifier (PPR-ID) and an attribute associated with a resource to be reserved on the PPR, transmitting, by the NE, the advertisement comprising the PPR-ID and the attribute associated with the resource to be reserved on the PPR to another NE in the network, and updating, by the NE, a local forwarding database to include the PPR information in association with the egress NE in response to the NE being identified in the PPR information.

Resource reservation and maintenance for preferred path routes in a network

A method of routing a data packet through a network comprises updating at least one router local forwarding table to include path IDs of network segments defining paths between network nodes and network function bit encoding/decoding information. In response to a data packet arriving at an ingress network node, an encapsulation header including a path ID identifying at least one network segment of an explicit routing path and a bit encoding specifying network functions to be performed on the data packet are encapsulated in unused portions of the source address and/or the destination address in the encapsulation header. A network node in the explicit routing path performs a network function encoded in the source address and/or the destination address of the encapsulation header of the data packet and forwards the data packet based on network function bit encoding/decoding and path ID information in the network node's local updated local forwarding table.

Explicit routing with network function encoding

In one embodiment, a method comprises receiving, by a network device within a tree-based topology rooted by a root network device, a request message from a child network device for generating an optimized tree-based topology for a future use by the child network device at a future time instance; the network device executing an objective function for generating the optimized tree-based topology for the future use by the child network device; and the network device providing network communications, for the child network device, at the future time instance using the optimized tree-based topology.

Directed acyclic graph optimization for future time instance requested by a child network device

In one embodiment, a first router determines whether an interface coupling the first router to one or more second routers is transit-only. When the interface is transit-only, the first router generates an Open Shortest Path First (OSPF) Link State Advertisement (LSA) that includes an address for the interface and a designated network mask. The designated network mask operates as a transit-only identification that indicates the address should not be installed in a Routing Information Base (RIB) upon receipt of the OSPF LSA at the one or more second routers. When the network is not transit-only, the first router generates an OSPF LSA that includes the address for the interface but does not include the designated network mask, to permit installation of the address in a RIB upon receipt of the OSPF LSA at the one or more second routers.

Apparatus and method to hide transit only multi-access networks in OSPF

In one embodiment, a method comprises identifying, by a network device, a future time interval for establishment of a corresponding future tree-based topology that is to be optimized according to an identified objective function, the future tree-based topology and corresponding identified objective function distinct from a current tree-based topology optimized according to a corresponding current objective function; and generating and outputting, by the network device, a message advertising the network device offering availability of the future tree-based topology optimized at the future time interval for the identified objective function, enabling other network devices to attach to the network device during the future time interval for communications optimized according to the identified objective function.

Directed acyclic graph optimization for future time instance advertised by a parent network device

Present disclosure relates to methods for preparing BGP update messages for transmission and processing received update messages. The methods are based on grouping path attributes common to a plurality of IP address prefixes into respective sets identified with respective set identifiers and, instead of duplicating path attributes in each BGP update message, including a respective identifier referring to a certain set of path attributes provided in an earlier BGP update message when sending subsequent update messages. Grouping of path attributes into individual sets associated with respective identifiers provides significant advantages by enabling re-use of the results of previous processing on both the sending and receiving sides associated with transmission of BGP update messages. In addition, such an approach limits the amount of information transmitted in the control plane because duplicate sets of path attributes may only be transmitted once and merely be referred to in subsequent update messages.

Attribute SET_ID in border gateway protocol

[object Object]

In one embodiment, non-eligible distance vector protocol paths are used as backup paths. In one embodiment, the distance vector protocol is Enhanced Interior Gateway Protocol (EIGRP) and unless a path is a feasible successor for a destination, the path is not eligible as a backup path. Therefore, if there is no feasible successor, there is no eligible backup path. One embodiment avoids an initial delay in finding a replacement path for traffic by determining and installing a non-eligible backup path (e.g., a path that is not a feasible successor) in one or more forwarding tables. In this manner, the router can immediately forward packets over this non-eligible backup path until, for example, forwarding in the network can converge in light of the primary path being no longer available.

Non-eligible distance vector protocol paths as backup paths

According to an implementation, a method for signaling that a first network node exists in a network is following entry of the first network node into a reduced power mode includes receiving, in a second network node, an indication that the first network node will enter into the reduced-power mode. The method also includes generating information that signals the existence of the first network node and that the first network node is reachable in the network and communicating the information to the network such that the second network node operates as a proxy advertiser for the first network node following entry of the first network node into the reduced-power mode.

Signaling existence of a network node that is in a reduced-power mode

A method for controlling transit of routing messages in a network comprising multiple autonomous systems (AS) is disclosed. The method includes receiving, at a first AS, a routing message of an inter-AS routing protocol and identifying that the routing message comprises transit domain control (TDC) information specifying one or more autonomous systems to which the routing message may be propagated and/or one or more autonomous systems to which the routing message may not be propagated. The method further includes propagating the routing message from the first AS to a second AS in accordance with the TDC information.

Transit domain control

In one embodiment, a router located at an exit edge of an autonomous system (AS) receives a data packet in a data plane, and determines a destination of the data packet and an associated AS-path information to the destination. The router may then insert the AS-path information into the data packet, and forwards the data packet with the AS-path information toward the destination, such that a receiving device in a destination AS can validate whether the data packet was routed through a path that was secure from a control plane perspective based on a collection of one or more insertions of AS-path information.

Tying data plane paths to a secure control plane

In one embodiment, a validation server in a computer network determines that an edge router of the computer network has blocked access to a desired server address based on the edge router not having authentication information for the desired server address. In response, the server creates a white-listing policy to temporarily allow access to the desired server address at the edge router, and sends the white-listing policy to the edge router. The validation server may then proceed with performing server fetching operations to the desired server address from the validation server while the white-listing policy is in effect, and instructs the edge device to remove the white-listing policy once the server fetching operations are completed.

Overcoming circular dependencies when bootstrapping an RPKI site

Growing community of inventors

Morrisville, NC, United States of America

Alvaro E Retana