Ciena Corporation

Cisco Technology, Inc.

Bhupendra Yadav

Carlos M Pignataro

Clarence Filsfils

Nagendra Kumar Nainar

Zafar Ali

Rakesh Gandhi

Ahmed Refaat Bashandy

Syed Kamran Raza

Jaganbabu Rajamanickam

Faisal Iqbal

Gerald Smallegange

Prabhu Vaithilingam

Alwyn Joy George

Anand Srinivasan

Senthil Balakrishnan

Shashanka Shobhit Shankara

Systems and methods for zero touch configuration for a mesh of nodes using Segment Routing Flexible Algorithm define a Flex Algo Definition (FAD) of an auto-mesh plane. A method, in one embodiment, includes, responsive to the FAD, providing an advertisement of a Prefix Segment Identifier (SID) for a node in the auto-mesh plane; and including a flag in the advertisement designating whether the node is a destination node or a non-destination node in the auto-mesh plane. The destination node is one which requires transport connectivity to all other destination nodes in the auto-mesh plane, and the non-destination node is one used for reachability to all the destination nodes.

Zero touch configuration for a mesh of nodes using segment routing flexible algorithm

In one embodiment, a service chain data packet is instrumented as it is communicated among network nodes in a network providing service-level and/or networking operations visibility. The service chain data packet includes a particular header identifying a service group defining one or more service functions, and is a data packet and not a probe packet. A network node adds networking and/or service-layer operations data to the particular service chain data packet, such as, but not limited to, in the particular header. Such networking operations data includes a performance metric or attribute related to the transport of the particular service chain packet in the network. Such service-layer operations data includes a performance metric or attribute related to the service-level processing of the particular service chain data packet in the network.

Segment routing network signaling and packet processing

Systems and methods include maintaining a network plane in Segment Routing (SR) Flexible Algorithm having a Flexible Algorithm Definition (FAD) based on latency; receiving a request for a service over a SR network where the service is sensitive to a specific latency; and determining a label stack including one or more Segment Identifiers (SID) for the service, with the one or more SIDs based on the network plane in SR Flexible Algorithm. This can be used for Private Line Emulation (PLE) services and Circuit Emulation (CEM) services over SR, ensuring latency while not requiring large label stacks.

Latency sensitive network plane via SR flex algorithm for layer 1 services

Systems and methods for dynamic path computation in networks based on automatically detected unavoidable risks include receiving a plurality of shared risks associated with any of one or more network layers, network links, and network equipment; automatically creating a local ignore list for a source node and a remote ignore list for a destination node, based on the plurality of shared risks; and utilizing the plurality of shared risks in a path computation for a path between the source node and the destination node and ignoring any of the plurality of shared risks in the local ignore list and the remote ignore list.

Dynamic path computation in networks based on automatically detected unavoidable risks

Systems and methods for computing forward and reverse paths and checking the liveness, keep-alive status, or continuity of the forward and reverse paths are provided. A method, according to one implementation, includes the step of creating one or more messages related to a computation of a forward path from a head-end node to a tail-end node and a computation of a reverse path from the tail-end node to the head-end node. The method also includes the step of adding a data object to the one or more messages, the data object including an intent to check the liveness of the forward path and reverse path.

Computing forward and reverse paths and checking the liveness thereof

Systems and methods for extended protection in a Segment Routing network that utilizes Flexible Algorithm include defining a first Flexible Algorithm that segregates the Segment Routing network into a first subset network that excludes any of links and nodes from the Segment Routing network; defining a second Flexible Algorithm that segregates the Segment Routing network into a second subset network, different from the first subset network; and defining extended protection for the first Flexible Algorithm with the second Flexible Algorithm whereby the second Flexible Algorithm is usable for path to protect the first Flexible Algorithm.

Extended protection in segment routing flexible algorithm

In one embodiment, segment routing (SR) network processing of packets is performed which includes operations signaling and processing of packets in manners providing processing and/or memory efficiencies. One embodiment includes acquiring a segment routing particular packet by a particular router in a network. Responsive to the particular router data plane ascertained during fast path processing by a fast path processing unit that the segment routing particular packet is to be Operations, Administration, and Maintenance (OAM) processed by a different processing unit in the particular router, communicating a time stamp of a current time and the segment routing particular packet including a segment routing header that includes OAM signaling from said fast path processing to the different processing unit, with fast path processing being hardware-based packet processing by the fast path processing unit. The segment routing particular packet is OAM processing by the different processing unit.

A source node in a first domain in a multi-domain network includes a plurality of ports; and switching circuitry configured to forward packets between the plurality of ports, wherein the source node is configured to, for a packet destined for a destination node in another domain in the multi-domain network, add a list of Segment Identifiers (SIDs) to the packet for loose source-based routing from the source node, through the first domain, and to the another domain, and forward the packet via a port of the plurality of ports and with the list of SIDs, wherein the list of SIDs includes at least one SID representing both an anycast SID and a binding SID. The SID is associated with an anycast group that includes a plurality of nodes, and with a binding segment in the second domain, the binding segment includes a different SID list for each node of the plurality of nodes.

Resolving label depth and protection in segment routing

Segment routing network processing of packets including operations signaling and processing of packets in manners providing processing and/or memory efficiencies

Growing community of inventors

Kanata, Canada

Bhupendra Yadav