Cisco Technology, Inc.

Huawei Technologies Co., Limited

Future Wei Technologies, Inc.

Cisco Systems Inc.

Toerless Eckert

Ijsbrand Wijnands

Arjen Boers

Daniel A Alvarez

Lorenzo Vicisano

Neale D R Ranns

Yiqun Cai

Gregory J Shepherd

Uma S Chunduri

Yingzhen Qu

Rajiv Asati

Brian Eliot Weis

Bing Liu

Alvaro E Retana

Michael Anthony Ramalho

Sheng Jiang

James E Coffman

Mohamed Kamel Zanaty

John S Meylor

Gregory A Shepherd

Pascal Thubert

Charles Calvin Byers

Stefano Benedetto Previdi

David R Oran

Stewart Frederick Bryant

Renwei Li

Nancy Cam-Winget

Alon Shlomo Bernstein

Hugo Latapie

Ian Michael Charles Shand

Dino Farinacci

Enzo Fenoglio

Alexander Clemm

Joseph T Friel

Michael Freed

Subhasri Dhesikan

Francois Le Faucheur

Ali C Begen

Stig Ingvar Venaas

Joshua B Gahm

William C Ver Steeg

Max Pritikin

Steinthor Bjarnason

Andre Jean-Marie Surcouf

James Martin Polk

Eliot Lear

Pete Rai

Mihailo Zilovic

Heidi H Ou

Sundher Narayanaswamy

Anil Thomas

Michael H Behringer

Liming Wei

Chickayya Naik

Ashok Narayanan

Faisal Siyavudeen

Isidoros Kouvelas

Yves Hertoghs

Hongliang Gao

Senthil Arunachalam

Harsh Parandekar

Gary Beau Williamson

Ishan Wu

Senthilkumar Krishnamurthy

Andrew Harris Kessler

Balaji B L

B L Balaji

Steve Simlo

Michael Behringer

BL Balaji

A method implemented by a network element (NE) in a network, comprising receiving, by the NE, preferred path route (PPR) information comprising a PPR identifier (PPR-ID) and a plurality of PPR-Path Description Elements (PPR-PDEs), wherein a PPR-PDE describing the egress NE comprises a destination flag, an anycast PPR-ID, and an anycast group PPR-ID associated with the egress NE, and updating, by the NE, a forwarding database to include a forwarding entry for the egress NE, wherein the forwarding entry includes the PPR-ID, the anycast PPR-ID, and the anycast group PPR-ID, and wherein the forwarding entry indicates a next element on the PPR graph by which to forward an anycast data packet comprising the anycast PPR-ID.

Advanced preferred path route graph features in a network

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 network device includes a transmitter and a receiver to establish a secure connection with one or more network nodes as part of a Autonomic Control Plane (ACP) network. The network device also includes a processor coupled to the transmitter and receiver. The processor receives a request from an application to initiate a connection with a destination network node. The processor also receives packets from the application for transmission toward the destination network node. When the packets from the application are unencrypted, the processor end-to-end encrypts the unencrypted packets without notifying the application. The transmitter then transmits the encrypted packets towards the destination network node across the ACP network.

Lightweight secure autonomic control plane

A method implemented by a network element (NE) in a network, comprising receiving, by the NE, preferred path route (PPR) information describing a PPR graph, the PPR graph representing a plurality of PPRs between an ingress NE and an egress NE in the network, and updating, by the NE, a forwarding database to include a forwarding entry for the egress NE in response to identifying the NE in the plurality of PPR-PDEs, the forwarding entry indicating a next hop by which to forward a data packet comprising the PPR-ID.

Preferred path route graphs in a network

A first Bit Index Explicit Replication Traffic Engineering (BIER-TE) node of a network includes a first interface to a second BIER-TE node in the network. The first node includes a configuration topology and an operational topology. The configuration topology represents the configuration of the network and the operational topology represents usable and consistent links in the network topology. The first node receives first network topology information and updates the configuration topology with the first network topology information. The first node also verifies the first network topology information and updates the operational topology with the first network topology information responsive to the verification. The first node receives a packet including a routing bitstring having a set bit at a first bit index corresponding to the first interface and routes the packet to the second node responsive to the routing bitstring and the operational topology.

IGP topology information and use for BIER-TE

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

Latency Based Forwarding (LBF) techniques are presented for the management of the latencies, or delays, of packets forwarded over nodes, such as routers, of a network. In addition to a network header indicating a destination node for receiving the packet, a packet also includes an LBF header indicating the packets accumulated delay since leaving the sender, a maximum latency for the entire journey from the sender to the receiver and a minimum latency for the entire journey from the sender to the receiver. When a packet is received at a node, based on the accumulated delay, the maximum latency, and the minimum latency, the node places the packet in a forwarding queue to manage the delays between the sender and the receiver. The LBF can also indicate a policy for the forwarding node to used when determining the enqueueing of the packet.

Latency based forwarding of packets with destination policies

A network device is provided that comprises a plurality of physical ports, an autonomic device fabric (ADF) module configured to receive, send, and forward data packets via the plurality of physical ports, a memory that stores instructions, and one or more processors configured by the instructions to perform operations. The operations comprise determining that network device software is not installed and requesting the network device software from a management machine using the ADF module.

Autonomic device fabric

Methods, network devices and computer readable media are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving, at an ingress node of a network, a message associated with a message flow, obtaining a message bit array corresponding to the message flow, encapsulating the message with the message bit array to form an encapsulated message, and forwarding the encapsulated message into the network. Bit positions in the message bit array are assigned to separate segments of a path or tree in the network, and an explicit path or tree for the message flow is defined as an end to end connection of multiple segments assigned bit positions having a first bit value in the message bit array.

Traffic engineering for bit indexed explicit replication

In one embodiment, a device in a network receives node information regarding a plurality of nodes that are to join the network. The device determines network formation parameters based on the received node information. The network formation parameters are indicative of a network join schedule and join location for a particular node from the plurality of nodes. The device generates, according to the network join schedule, a join invitation for the particular node based on the network formation parameters. The join invitation allows the particular node to attempt joining the network at the join location via a specified access point. The device causes the sending of one or more beacons via the network that include the join invitation to the particular node. The particular node attempts to join the network via the specified access point based on the one or more beacons.

Coordinating zero touch network joins

A system and method for provisioning secure devices onto a network are provided. The system includes a voucher server configured to provide a vouchers to a logistics device, and a secure pledge device associated with an RFID (Radio Frequency Identifier) chip, wherein the RFID chip comprises the voucher obtained from the voucher server and written to the RFID chip by the logistics device and the voucher is used for provisioning the pledge device to a customer network.

System and method for provisioning devices using RFID

Methods and network devices are disclosed for failure protection in traffic-engineered bit indexed explicit replication networks. In one embodiment, a method includes determining a protected link or node in a network, where the protected link or node is included in a designated path to be taken by a message through the network to a destination node, the designated path is encoded in a message bit array carried by the message, and assigned bit positions in the message bit array represent respective network links along the designated path. The method further includes determining a backup path to the destination node from a feeder node adapted to forward a message carrying the message bit array into the protected link or node, and populating an entry in a path update table stored at the feeder node. In one embodiment a network device includes a network interface and a processor configured to carry out the methods.

Failure protection for traffic-engineered bit indexed explicit replication

Methods and network devices are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving at a first node in a network a message comprising a message bit array, and comparing bit values at one or more bit positions in the message bit array to one or more entries in a forwarding table stored at the first node. The one or more bit positions correspond in this embodiment to links in the network. This embodiment of the method further includes forwarding the message over a link represented in the forwarding table if a result of the comparing indicates that the link is included in a path to be taken by the message. In a further embodiment of the method, the message is a multicast message and forwarding the message comprises forwarding a replica of the multicast message.

Growing community of inventors

Mountain View, CA, United States of America

Toerless Eckert