Abstract: Systems and methods for fast restoration in a network using a control plane include detecting a failure on a link associated with the node; and providing failure information through in-band data path overhead of an affected connection, wherein the in-band data path overhead is sent over a fast path, wherein the failure information is received at an originating node of the affected connection via the fast path, prior to the originating node receiving control plane signaling via a slow path relative to the fast path.

Abstract: A method for establishing an alternate pathway to an endpoint that may determine that a network connection is lost between a first network element and an application server. The method may select a second network element from a virtual network operating on an optical network. The second network element may include a network connection over the optical network to the application server, and a network connection to the first network element over the virtual network. The method may designate the second network element to act as a network proxy to the first network element. The first network element may use the second network element as the network proxy for receiving data over the virtual network. The method may receive data from the application server at the first network element using the second network element as the network proxy.

Abstract: A method, in a network element, for detecting and propagating resizability information of an Optical channel Data Unit flex (ODUflex) connection includes receiving resizability information in overhead associated with the ODUflex connection, wherein the resizability information indicates a number of available tributary slots and whether the ODUflex connection is symmetric; and adjusting the resizability information based on a change in the available tributary slots due to a bandwidth change at the network element. The systems and methods include a solution to communicate, in real time, the resizability information of an ODUflex connection utilizing the associated data path to carry it instead of the management/control plane.

Abstract: A method for performing an operation at a non-originating node of a connection includes receiving a request for the operation; determining information associated with the connection; and signaling, based on the information and the operation, an originating node to cause the originating node to perform call connection management on the connection. A non-originating node includes a plurality of ports with at least one connection thereon; and a controller communicatively coupled to the plurality of ports and operating a control plane, wherein, for an operation of call connection management on the at least one connection, the controller is configured to: determine information associated with the at least one connection on a link formed by a port; and signal, based on the information and the operation, an originating node of the at least one connection to perform the call connection management on the at least one connection.

Abstract: A method in a network utilizing a distributed connection-oriented control plane includes signaling a first path for a first connection from a first source node; storing call information for the first connection at any intermediate nodes in the first path; signaling a second path for a second connection from a second source node; checking at any intermediate nodes in the second path if there is absolute route diversity between the first connection and the second connection responsive to a requirement therein; and responsive to detecting a diversity violation at an intermediate node of the any intermediate nodes in the second path, signaling a crankback to the second source node with the call information for the first connection included therein; and recomputing the second path exclusive of the first path based on the call information responsive to receiving the crankback. A network and node are also described.

Abstract: A method for establishing an alternate pathway to an endpoint that may determine that a network connection is lost between a first network element and an application server. The method may select a second network element from a virtual network operating on an optical network. The second network element may include a network connection over the optical network to the application server, and a network connection to the first network element over the virtual network. The method may designate the second network element to act as a network proxy to the first network element. The first network element may use the second network element as the network proxy for receiving data over the virtual network. The method may receive data from the application server at the first network element using the second network element as the network proxy.

Abstract: Systems and methods for fast restoration in a network using a control plane include detecting a failure on a link associated with the node; and providing failure information through in-band data path overhead of an affected connection, wherein the in-band data path overhead is sent over a fast path, wherein the failure information is received at an originating node of the affected connection via the fast path, prior to the originating node receiving control plane signaling via a slow path relative to the fast path.

Abstract: A method, a network, and a node include computing a path by a source node; sending a message to nodes in the path with associated validation criteria; locally checking the validation criteria at each of the nodes in the path; if the validation criteria is satisfied at the node, forwarding the message to the next node in the path; else there is a validation criteria failure at the node, appending feedback data to the message, converting the message to a validation message, and forwarding the validation message to the next node in the path; and at a destination node, if there are no validation criteria failures, then establishing the connection; else issuing a release message to the source node with all the feedback such that the source node can compute a new path exclusive of nodes where the validation criteria fails.

Abstract: A method for performing an operation at a non-originating node of a connection includes receiving a request for the operation; determining information associated with the connection; and signaling, based on the information and the operation, an originating node to cause the originating node to perform call connection management on the connection. A non-originating node includes a plurality of ports with at least one connection thereon; and a controller communicatively coupled to the plurality of ports and operating a control plane, wherein, for an operation of call connection management on the at least one connection, the controller is configured to: determine information associated with the at least one connection on a link formed by a port; and signal, based on the information and the operation, an originating node of the at least one connection to perform the call connection management on the at least one connection.

Abstract: A method, in a network element, for detecting and propagating resizability information of an Optical channel Data Unit flex (ODUflex) connection includes receiving resizability information in overhead associated with the ODUflex connection, wherein the resizability information indicates a number of available tributary slots and whether the ODUflex connection is symmetric; and adjusting the resizability information based on a change in the available tributary slots due to a bandwidth change at the network element. The systems and methods include a solution to communicate, in real time, the resizability information of an ODUflex connection utilizing the associated data path to carry it instead of the management/control plane.

Abstract: A method, a network, and a node include computing a path by a source node; sending a message to nodes in the path with associated validation criteria; locally checking the validation criteria at each of the nodes in the path; if the validation criteria is satisfied at the node, forwarding the message to the next node in the path; else there is a validation criteria failure at the node, appending feedback data to the message, converting the message to a validation message, and forwarding the validation message to the next node in the path; and at a destination node, if there are no validation criteria failures, then establishing the connection; else issuing a release message to the source node with all the feedback such that the source node can compute a new path exclusive of nodes where the validation criteria fails.

Abstract: A method in a network utilizing a distributed connection-oriented control plane includes signaling a first path for a first connection from a first source node; storing call information for the first connection at any intermediate nodes in the first path; signaling a second path for a second connection from a second source node; checking at any intermediate nodes in the second path if there is absolute route diversity between the first connection and the second connection responsive to a requirement therein; and responsive to detecting a diversity violation at an intermediate node of the any intermediate nodes in the second path, signaling a crankback to the second source node with the call information for the first connection included therein; and recomputing the second path exclusive of the first path based on the call information responsive to receiving the crankback. A network and node are also described.

Abstract: A path computation method includes defining photonic constraints associated with a network, wherein the photonic constraints include wavelength capability constraints at each node in the network, wavelength availability constraints at each node in the network, and nodal connectivity constraints of each node in the network, and performing a constrained path computation in the network using Dijkstra's algorithm on a graph model of the network with the photonic constraints considered therein. An optical network includes a plurality of interconnected nodes each including wavelength capability constraints, wavelength availability constraints, and nodal connectivity constraints, and a path computation element associated with the plurality of interconnected photonic nodes, wherein the path computation element is configured to perform a constrained path computation through the plurality of interconnected nodes using Dijkstra's algorithm on a graph model with the photonic constraints considered therein.

Abstract: The present disclosure provides bandwidth defragmentation systems and methods in optical networks such as Optical Transport Network (OTN), Synchronous Optical Network (SONET), Synchronous Digital Hierarchy (SDH), Ethernet, and the like. In particular, the present invention includes bandwidth defragmentation algorithms that may be used within the context of a signaling and routing protocol to avoid bandwidth defragmentation. As such, the present invention defines a mechanism for computing an end to end path for a connection in a manner that avoids bandwidth fragmentation and provides for better network utilization. For example, the present invention may include a path computation based upon administrative weight and upon fragmentation costs. This may be implemented in existing signaling and routing protocols without changes to existing protocol messages used in topology discovery.

Abstract: The present disclosure provides absolute route diversity (ARD) for mesh restorable sub-network connection protection (MR-SNCP) services. ARD addresses concerns in MR-SNCP by providing absolute path diversity between both paths (e.g., peer Sub Network Connections (SNCs)) of an MR-SNCP connection. If an ARD condition is not met, the peer SNC is not mesh restored and the MR-SNCP works with just one single SNC. The advantage of this approach is to reuse the bandwidth saved from ARD for other MR-SNCP, i.e. more efficient bandwidth utilization due to ARD for other MR-SNCPs, and better service quality guarantee (protection) in terms of planning and managing the network bandwidth.

Abstract: A path computation method includes defining photonic constraints associated with a network, wherein the photonic constraints include wavelength capability constraints at each node in the network, wavelength availability constraints at each node in the network, and nodal connectivity constraints of each node in the network, and performing a constrained path computation in the network using Dijkstra's algorithm on a graph model of the network with the photonic constraints considered therein. An optical network includes a plurality of interconnected nodes each including wavelength capability constraints, wavelength availability constraints, and nodal connectivity constraints, and a path computation element associated with the plurality of interconnected photonic nodes, wherein the path computation element is configured to perform a constrained path computation through the plurality of interconnected nodes using Dijkstra's algorithm on a graph model with the photonic constraints considered therein.

Abstract: The present disclosure provides bandwidth defragmentation systems and methods in optical networks such as Optical Transport Network (OTN), Synchronous Optical Network (SONET), Synchronous Digital Hierarchy (SDH), Ethernet, and the like. In particular, the present invention includes bandwidth defragmentation algorithms that may be used within the context of a signaling and routing protocol to avoid bandwidth defragmentation. As such, the present invention defines a mechanism for computing an end to end path for a connection in a manner that avoids bandwidth fragmentation and provides for better network utilization. For example, the present invention may include a path computation based upon administrative weight and upon fragmentation costs. This may be implemented in existing signaling and routing protocols without changes to existing protocol messages used in topology discovery.

Abstract: The present disclosure provides absolute route diversity (ARD) for mesh restorable sub-network connection protection (MR-SNCP) services. ARD addresses concerns in MR-SNCP by providing absolute path diversity between both paths (e.g., peer Sub Network Connections (SNCs)) of an MR-SNCP connection. If an ARD condition is not met, the peer SNC is not mesh restored and the MR-SNCP works with just one single SNC. The advantage of this approach is to reuse the bandwidth saved from ARD for other MR-SNCP, i.e. more efficient bandwidth utilization due to ARD for other MR-SNCPs, and better service quality guarantee (protection) in terms of planning and managing the network bandwidth.