Ciena Corporation

Rockstar Consortium US LP

Gerald Smallegange

Bhupendra Yadav

Prabhu Vaithilingam

Alwyn Joy George

Darek Robert Skalecki

Nigel Lawrence Bragg

Marc Holness

Dinesh Mohan

Paul Unbehagen

Himanshu Shah

Donald Russell Ellis

Amal Karboubi

Anand Srinivasan

Brett Caldwell

Anurag Prakash

Chaitanya Varma Guntumadugu

Allan Phillips

Barry Davies

Samson Punnammoottil Ninan

Jayesh Jayachandra Kumar

A Border Gateway Protocol (BGP) router is configured to obtain a plurality of prefix-lists one or more of (i) in local Outbound Route Filtering (ORF) and (ii) in ORF from upstream BGP routers, automatically apply logical set operations on the plurality of prefix-lists to determine an aggregated ORF for a downstream BGP router, and propagate the aggregated ORF to the downstream BGP router which uses the aggregated ORF for BGP advertisements. This can include auto generation of sequence numbers for the plurality of prefix-lists in the aggregated ORF, such that the downstream BGP router uses the sequence numbers for precedence in the advertisements. The prefix-lists can include one or more PERMIT lists, DENY lists, and a combination of PERMIT and DENY lists, with the logical set operations including union with the PERMIT lists, intersection with the DENY lists, and a combination of union, intersection, and set differences with the combination of PERMIT and DENY lists.

Automated ORF propagation in BGP networks

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

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

Variable preemption for label-switched paths (LSP) tunnels includes provisioning a label-switched path (LSP) tunnel at a first bandwidth with a first priority value; and provisioning one or more different priority values at one or more of (1) corresponding one or more bandwidths such that a current priority value of the LSP tunnel is set based on a current bandwidth value of the LSP tunnel and (2) redial failure attempts such that the current priority value of the LSP tunnel is set based on a number of the redial failure attempts. The priority values can include one of a Setup Priority, a Holding Priority, and a combination thereof. The one of the Setup Priority, the Holding Priority, and the combination thereof can be based on RFC 3209.

Variable preemption for LSP tunnels

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

Systems and methods for permitted network risks in diverse route determinations introduce the concept of permitted network risks which are risks that may be present in a disjoint path calculation. This removes the binary logic in conventional shared risk path determination, i.e., either exclude or include. With the present disclosure, a network risk may be excluded (must never use) or shared (may use if needed). In an embodiment, if a route for a backup tunnel or path excluding all network risks is not possible, then a route for the backup tunnel or path may be found excluding some network risks of the primary tunnel or path except specified network risks that are determined/specified as permitted network risks. Such permitted network risks can be explicitly specified by a network operator or implicitly determined based on a category (e.g., node and/or equipment may be shared network risks whereas links may not).

Permitted network risks in diverse route determinations

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

The present disclosure provides protection systems and methods that provide a mechanism to identify/determine when an interconnection node has been isolated (i.e. when there is no connectivity between a pair of interconnection nodes), from a data path perspective. If/when this condition exists, actions are triggered on the subtending sub-ring that essentially perform a protection switch (which causes the subtending sub-ring nodes to cleanse their forwarding tables), and, more importantly, that remove any channel blocks on the subtending sub-ring. Extensions to the ITU-T G.8032 state machine are also provided that include support for operator command interactions (e.g. DNR, force switch, manual switch, etc.). The protection systems and methods of the present disclosure enable the reliable application of ITU-T G.8032 and the like to more complex (i.e. meshed) deployment environments, among other significant advantages.

Protection systems and methods for handling multiple faults and isolated nodes in interconnected ring networks

MPLS networks offering PW or VPLS services may be interconnected with Ethernet networks implemented according to 802.1or 802.1Qay. The MPLS network may be a core and offer services to the Ethernet access networks, or vise-versa. Additionally, a mixture of different types of access networks may be interconnected by an MPLS core or an Ethernet core. Both network interworking and service interworking are provided. OAM fault detection may be implemented via maintenance entities extending across the network or end to end depending on the combination of networks and services offered by the networks.

Method and apparatus for interworking ethernet and MPLS networks

A method and apparatus is described which enables location information associated with a client to easily be obtained by a service provider in a packet-based network. The location information may be the location of the client itself, or may be location information associated with devices in a communication facility established by the client. Location information associated with the client may be provided to services such as emergency services to facilitate fast dispatch of resources to assist the client. Location information associated with facilities of the client may be used to facilitate lawful interception of client communications. In one embodiment, the location information is obtained using information included in one of a Provider Backbone Bridge (PBB) or Provider Backbone Transport (PBT) packet.

Growing community of inventors

Stittsville, Canada

Gerald Smallegange