Provided are optical communication signal recovery techniques and a submarine optical communication recovery device may include a number of inputs, a number of outputs and a number of optical switch modules. Each input may be operable to connect to a respective optical fiber of a submarine fiber optic cable, and a number of the optical fibers carry optical signals and at least one optical fiber of the plurality of optical fibers is an unusable optical path that is unable to carry a usable optical signal. Each output may couple to another respective optical fiber, and a number of the outputs may be designated as impaired outputs. Each optical switch module of the number of optical switch modules may be operable to connect an input of the number of inputs coupled to the unusable optical path to an impaired output of the number of the impaired outputs.

A network system for a data center is described in which a switch fabric provides interconnectivity such that any servers may communicate packet data to any other of the servers using any of a number of parallel data paths. Moreover, according to the techniques described herein, edge-positioned access nodes, permutation devices and core switches of the switch fabric may be configured and arranged in a way such that the parallel data paths provide single L2/L3 hop, full mesh interconnections between any pairwise combination of the access nodes, even in massive data centers having tens of thousands of servers. The access nodes may be arranged within access node groups, and permutation devices may be used within the access node groups to spray packets across the access node groups prior to injection within the switch fabric, thereby increasing the fanout and scalability of the network system.

A method of assigning performance indicators to objects of a network employing a computation to assign performance indicators to said objects of said network such that a sum of said performance indicators of objects along a given path in said network in relation to a first threshold value indicates whether said path fulfils a predetermined criterion, and/or indicates whether said path does not fulfil said predetermined criterion.

A method of evaluating a performance of a path in a network based on the performance indicators involves the steps of calculating a sum of performance indicators for said objects along said path and evaluating a performance of said path by comparing said sum against a first threshold value.

Provided are a method and device for mapping, multiplexing, demapping and demultiplexing data are provided. The method includes: mapping an Ethernet service data stream the rate of which is m*100 Gb/s sequentially into m Optical Payload Unit Sub-frames (OPUC) and multiplexing the m OPUC into an Optical Payload Unit Frame (OPUCm) the rate of which is m*100 Gb/s according to the way of byte interleave; and adding an Optical Channel Data Unit (ODU) overhead to the head of the OPUCm to obtain an Optical Channel Data Unit Frame (ODUCm) the rate of which is m*100 Gb/s, wherein the frame structure of the OPUC consists of 4 rows and 3810 columns; the frame structure of the OPUCm consists of 4 rows and 3810*m columns; and the frame structure of the ODUCm consists of 4 rows and 3824*m columns, wherein m is a positive integer. The present disclosure improves the spectrum efficiency of optical fibers and the systematic flexibility and the compatibility.

Disclosed are a method and device for managing optical channel overhead, and an optical signal receiving node. The method comprises: optical channel overhead information is structured, wherein the optical channel overhead information comprises at least one of the following: the optical channel nominal central frequency, the optical channel application code, and the optical channel trail trace identifier; and the optical channel overhead information is sent to the optical signal receiving node. The disclosure solves the technical problem in the related art of an inability to negotiate a single, unified optical channel nominal central frequency and application code between the optical transmitter and the optical receiver, i.e. the disclosure enables an optical transmitter and the optical receiver to negotiate such the nominal central frequency and application code, thereby achieving the technical result of an optical signal being correctly sent and received.

In one embodiment, a method includes receiving, by a network controller and from a first node of a network, information associated with a data stream of the network and determining, by the network controller, a segmentation for the data stream. The segmentation includes a plurality of data segments and the plurality of data segments includes a first data segment. The method further includes determining, by the network controller, a data flow path for each of the plurality of data segments and determining, by the network controller, a first wavelength to assign to the first data segment. The first wavelength is one of a plurality of wavelengths spanning between the first node and a second node of the network.

Methods and apparatus for monetizing a carrier network are provided. In an example, a wavelength service is captured from deployed network assets in a carrier network. A revenue factor (R), a capital expenditure factor (C), an operational expenditure factor (O), and a service level agreement factor (S) are selected from an analytic profile of the carrier network based on the wavelength service requirements. The R, C, O, and S factors are hexadecimal numbers, and can be weighted relative to each other. An index is calculated by concatenating the R, C, O, and S factors a prioritized order and converting the resultant hexadecimal number into a decimal number. The calculated index is assigned to the wavelength service. The index can be displayed, along with indices for other wavelengths on other paths, to a user in a graphical form.

Techniques for providing closed-loop control and predictive analytics in packet-optical networks are described. For example, an integrated, centralized controller provides tightly-integrated, closed-loop control over switching and routing services and the underling optical transport system of a communication network. In one implementation, the controller includes an analytics engine that applies predictable analytics to real-time status information received from a monitoring subsystem distributed throughout the underlying optical transport system. Responsive to the status information, the analytics engine applies rules to adaptively and proactively identify current or predicted topology-changing events and, responsive to those events, maps reroutes packet flows through a routing/switching network and control and, based on any updated bandwidth requirements due to topology changes, dynamically adjusts allocation and utilization of the optical spectrum and wavelengths within the underlying optical transport system.

A method, implemented in a network with a control plane, is described for creating a compound Service Level Agreement (SLA) call for a Time Division Multiplexing (TDM) service in the network. The method includes creating the call with a non-preemptible component and a preemptible component, the compound SLA comprising the non-preemptible component and the preemptible component; implementing endpoints for the call at a source node and a destination node; and responsive to a preemption event in the network, removing the preemptible component at the endpoints. A node and network are also described.

Methods and systems are provided for determining a shortest path with a constraint in an optical network. The method includes identifying a permitted number of events defined by the constraint. The method further includes creating virtual nodes for each node in the optical network, the virtual nodes corresponding with the permitted number of events. The method also includes traversing the virtual nodes from a source node to a destination node with a shortest path algorithm, wherein traversing the virtual nodes comprises creating virtual links between the virtual nodes when the constraint is not violated, the virtual link corresponding with a physical link; and identifying a shortest path between the source node and the destination node from the virtual links, the shortest path not violating the constraint.