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 includes profiling user-network interface (UNI) ports including Optical channel Data Unit flex (ODUflex) in a network; and adapting, using a max-flow routing criterion, network-network interface (NNI) ports comprising ODUflex based on the profiling. A network includes a plurality of network elements; a plurality of links interconnecting the plurality of network elements, wherein the plurality of links includes Layer 0 Dense Wave Division Multiplexing (DWDM) bandwidth and Layer 1 Optical Transport Network (OTN) bandwidth; and a control plane operating between the plurality of network elements; wherein the Layer 0 DWDM bandwidth and the Layer 1 OTN bandwidth is statistically multiplexed using the control plane and manager based on monitoring bandwidth usage thereon over time.

Abstract: Call setup methods in a multi-domain network and a multi-domain network use dynamic link tagging and/or overbooking of External Network-Network Interface (ENNI) links. Thus, improved call setup systems and methods include two approaches to improve upon the responsiveness of the network for connection setups including bandwidth reservation in optical networks using “dynamic link tags” and link overbooking in optical networks based on a greedy approach. The bandwidth reservation and the link overbooking can be utilized together or separately to improve call setup. Advantageously, the improved call setup systems and methods can provide a generic bandwidth reservation mechanism, such as in Automatically Switched Optical Network (ASON) networks, to overcome the limitation of ENNI in concurrently updating the abstract link bandwidth and thereby improving the responsiveness of the network.

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 of extending the control plane to a network edge for a network having first set of nodes of the network are designated as core nodes, each core node being operable to route subscriber traffic between a pair of neighbor core nodes and a second set of control-plane enabled nodes of the network designated as tail nodes, each tail node connected to a core node and operating only as a source or sink of subscriber traffic. Each core node that is connected to at least one tad node is designated as a host node. The host node is controlled to advertise summary information of its connected tail nodes to other core and tail nodes in the network, thus making it possible to extend control plane function to the tail nodes which can calculate connection routes, set-up/tear-down connections and perform connection failure recovery functions.

Abstract: A method and system of determining a new path through an optical network from a source node to a destination node when a link in an original path fails are disclosed. When a fault on a link is detected, adjoint weights are assigned to each operational link for each node on the original path. A connection cost is determined for each node based on the adjoint weights of the links connected to the node. A new path through the optical network is determined based at least in part on the adjoint weights and the connection costs.

Abstract: A method, in a node operating in a network with a control plane, to optimize wavelength retuning on service redials, includes detecting a failure on a link associated with the node; and, for each affected connections on the link, sending a respective release message to an associated originating node via the control plane, the release message including a protect path and a wavelength, wherein the release message is utilized by the associated originating node to redial the affected connections with the protect path and the wavelength determined by the node, to minimize wavelength retuning on the affected connections.

Abstract: Embodiments of the disclosure are directed to optimizing routing and wavelength assignment in a network. An embodiment determines a routing assignment for a network, wherein the routing assignment is determined using a decongestion cost-based function; and determines a wavelength assignment for the network based on vector difference. The determination of the wavelength assignment comprises spanning the network for a path; calculating a weighted correlation function for at least one length in the network; storing the weighted correlation; and determining if a next path exists. If a next path is found, spanning for a next path in the network, and if a next path is not found, returning the stored correlation.

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: Photonic link information collection and advertisement systems and methods enable photonic nodes (e.g., optical amplifiers) to operate within a control plane system in a distributed and real-time manner. For example, the photonic nodes may not require full control plane protocol stacks at each photonic node. In particular, the systems and methods provide a distributed discovery method for photonic links without requiring full participation in the control plane at the photonic nodes. Additionally, the systems and methods include network databases with amplifier configuration information in a control plane enabled network.

Abstract: Call setup methods in a multi-domain network and a multi-domain network use dynamic link tagging and/or overbooking of External Network-Network Interface (ENNI) links. Thus, improved call setup systems and methods include two approaches to improve upon the responsiveness of the network for connection setups including bandwidth reservation in optical networks using “dynamic link tags” and link overbooking in optical networks based on a greedy approach. The bandwidth reservation and the link overbooking can be utilized together or separately to improve call setup. Advantageously, the improved call setup systems and methods can provide a generic bandwidth reservation mechanism, such as in Automatically Switched Optical Network (ASON) networks, to overcome the limitation of ENNI in concurrently updating the abstract link bandwidth and thereby improving the responsiveness of the network.

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 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: A method of extending the control plane to a network edge for a network having first set of nodes of the network are designated as core nodes, each core node being operable to route subscriber traffic between a pair of neighbour core nodes and a second set of control-plane enabled nodes of the network designated as tail nodes, each tail node connected to a core node and operating only as a source or sink of subscriber traffic. Each core node that is connected to at least one tail node is designated as a host node. The host node is controlled to advertise summary information of its connected tail nodes to other core and tail nodes in the network, thus making it possible to extend control plane function to the tail nodes which can calculate connection routes, set-up/tear-down connections and perform connection failure recovery functions.

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: A method and system of determining a new path through an optical network from a source node to a destination node when a link in an original path fails are disclosed. When a fault on a link is detected, adjoint weights are assigned to each operational link for each node on the original path. A connection cost is determined for each node based on the adjoint weights of the links connected to the node. A new path through the optical network is determined based at least in part on the adjoint weights and the connection costs.

Abstract: Photonic link information collection and advertisement systems and methods enable photonic nodes (e.g., optical amplifiers) to operate within a control plane system in a distributed and real-time manner. For example, the photonic nodes may not require full control plane protocol stacks at each photonic node. In particular, the systems and methods provide a distributed discovery method for photonic links without requiring full participation in the control plane at the photonic nodes. Additionally, the systems and methods include network databases with amplifier configuration information in a control plane enabled network.