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: An Optical Transport Network (OTN) transient management method, OTN node, and OTN network includes operating an OTN connection in a first mode in a network, the OTN connection traverses at least two nodes in the network, requesting a change in the OTN connection to a second mode which will cause a network transient, the change includes a timing change on the OTN connection affecting the at least two nodes, and performing transient management at the at least two nodes to mitigate the network transient, the transient management prevents spurious alarms due to the change between the first mode and the second mode.

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: 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: An Optical Transport Network (OTN) transient management method, OTN node, and OTN network includes operating an OTN connection in a first mode in a network, the OTN connection traverses at least two nodes in the network, requesting a change in the OTN connection to a second mode which will cause a network transient, the change includes a timing change on the OTN connection affecting the at least two nodes, and performing transient management at the at least two nodes to mitigate the network transient, the transient management prevents spurious alarms due to the change between the first mode and the second mode.

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.

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: A computer system is formed by coupling at least two modules to one another. The at least two modules includes a first module and a second module. Each of the first module and the second module has a display screen such that when the first module and the second module are placed adjacent to each other, the display screen of the first module and the display screen of the second module form a viewing area. The first module and the second module have components to form a computer.