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: Systems and methods for computing disjoint paths in a network considering continuity constraints include, responsive to a request for disjoint paths in the network which are subject to the continuity constraints, initializing a plurality of variables associated with a graph defining the network where edges constitute nodes and vertices constitute links; determining a first path through the graph; determining an auxiliary directed graph based on the first path; and determining a second path through the auxiliary directed graph, wherein the second path is determined by considering entry into cut edges, exit from cut edges, and a destination in the auxiliary directed graph and the plurality of variables are adjusted based on the entry, the exit, and the destination to address the continuity constraints. This approach concept applies to not just continuity constraints but to any constraints, which are non-additive in nature; the objective function is still additive for Shortest Path First (SPF).

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: Systems and methods for computing disjoint paths in a network considering continuity constraints include, responsive to a request for disjoint paths in the network which are subject to the continuity constraints, initializing a plurality of variables associated with a graph defining the network where edges constitute nodes and vertices constitute links; determining a first path through the graph; determining an auxiliary directed graph based on the first path; and determining a second path through the auxiliary directed graph, wherein the second path is determined by considering entry into cut edges, exit from cut edges, and a destination in the auxiliary directed graph and the plurality of variables are adjusted based on the entry, the exit, and the destination to address the continuity constraints. This approach concept applies to not just continuity constraints but to any constraints, which are non-additive in nature; the objective function is still additive for Shortest Path First (SPF).

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, a controller, and a network include determining an opportunity cost metric for each of a plurality of links in a network including a plurality of nodes, wherein the opportunity cost metric comprises a future constraint reflecting expectations for growth on currently established connections on each link of the plurality of links; receiving a request for a new connection between two nodes of the plurality of nodes in the network; and utilizing a constraint-based routing algorithm to determine a path for the new connection between the two nodes, wherein the constraint-based routing algorithm determines the path through the plurality of nodes via the plurality of links based on a plurality of constraints including the opportunity cost metric.

Abstract: A method, a controller, and a network include determining an opportunity cost metric for each of a plurality of links in a network including a plurality of nodes, wherein the opportunity cost metric comprises a future constraint reflecting expectations for growth on currently established connections on each link of the plurality of links; receiving a request for a new connection between two nodes of the plurality of nodes in the network; and utilizing a constraint-based routing algorithm to determine a path for the new connection between the two nodes, wherein the constraint-based routing algorithm determines the path through the plurality of nodes via the plurality of links based on a plurality of constraints including the opportunity cost metric.

Abstract: A localized repair method in a network using a control plane includes, responsive to a failure on a local repair segment defined on a connection traversing the network, generating a release message in the control plane; attempting a local repair on the local repair segment; if the local repair is unsuccessful, transmitting the release message to redial the connection; and, if the local repair is successful, signaling a new sub-path based on the local repair. A controller and a network are also disclosed.

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 localized repair method in a network using a control plane includes, responsive to a failure on a local repair segment defined on a connection traversing the network, generating a release message in the control plane; attempting a local repair on the local repair segment; if the local repair is unsuccessful, transmitting the release message to redial the connection; and, if the local repair is successful, signaling a new sub-path based on the local repair. A controller and a network are also disclosed.

Abstract: A method, a system, and a network for coordination between a data control plane and photonic control in a network include operating the data control plane with photonic control messaging included therein, wherein the data control plane is configured to at least establish end-to-end paths between a plurality of network elements at Layer 1; transmitting a photonic control message in or by the data control plane responsive to a requirement for photonic layer information; processing, via the data control plane, the photonic layer information received from photonic control responsive to the photonic control message, wherein the photonic control is configured to adjust photonic hardware responsive to a change at a photonic layer; and performing an action by the data control plane considering the photonic layer information.

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 system, and a network for coordination between a data control plane and photonic control in a network include operating the data control plane with photonic control messaging included therein, wherein the data control plane is configured to at least establish end-to-end paths between a plurality of network elements at Layer 1; transmitting a photonic control message in or by the data control plane responsive to a requirement for photonic layer information; processing, via the data control plane, the photonic layer information received from photonic control responsive to the photonic control message, wherein the photonic control is configured to adjust photonic hardware responsive to a change at a photonic layer; and performing an action by the data control plane considering the photonic layer information.

Abstract: A method, a node, and a network include mesh restoration and bandwidth allocation systems and methods for shared risk connection groups for source-based routing control planes. The mesh restoration and bandwidth allocation systems and methods utilize signaling from a node closest to a point of failure to “advise” source nodes about protect paths to be taken for a particular unidirectional or bidirectional connection in the event of mesh restoration. Specifically, the systems and methods include an ability to correlate connection information as Shared Risk Connection Groups (SRCG) to optimally utilize network bandwidth in the event of failure. The systems and methods could also be used to optimally distribute connections in a mesh network as well, trying to utilize maximum bandwidth, in distributed or centralized environments. Effectively, the systems and method distributed path computation in the network away from solely being the responsibility of source nodes.

Abstract: A method, a node, and a network include mesh restoration and bandwidth allocation systems and methods for shared risk connection groups for source-based routing control planes. The mesh restoration and bandwidth allocation systems and methods utilize signaling from a node closest to a point of failure to “advise” source nodes about protect paths to be taken for a particular unidirectional or bidirectional connection in the event of mesh restoration. Specifically, the systems and methods include an ability to correlate connection information as Shared Risk Connection Groups (SRCG) to optimally utilize network bandwidth in the event of failure. The systems and methods could also be used to optimally distribute connections in a mesh network as well, trying to utilize maximum bandwidth, in distributed or centralized environments. Effectively, the systems and method distributed path computation in the network away from solely being the responsibility of source nodes.

Abstract: A framework is disclosed which enables a management system to manage completely different type of network elements (NEs) running different versions of their embedded software by introducing generic operational interfaces, generic data interfaces, information descriptors and self adaptive control mechanism. This Management system framework consists of mainly two parts a) core application and b) element-dependent components and c) a set of generic interfaces. When the management system is launched, it executes the core application. The core application comprises of network element independent version independent generic functionalities that can be used to interact with a variety of network elements and a dynamic control mechanism to make selection and placement of pluggable components at appropriate time and place during execution.