We present our data-collection and deep neural network (DNN)-training scheme for extracting the optical status from signals received by digital coherent optical receivers in fiber-optic networks. The DNN is trained with unlabeled datasets across multiple administrative network domains by combining federated learning and unsupervised learning. The scheme allows network administrators to train a common DNN-based encoder that extracts optical status in their networks without revealing their private datasets. An early-stage proof of concept was numerically demonstrated by simulation by estimating the optical signal-to-noise ratio and modulation format with 64-GBd 16QAM and quadrature phase-shift keying signals.

Multi-band transmission technologies promise to cost-effectively expand the capacity of optical networks by exploiting low-loss spectrum windows beyond the conventional band used in already-deployed fibers. While such technologies offer a high potential for capacity upgrades, available capacity is seriously restricted not only by the wavelength-continuity constraint but also by the signal-to-noise ratio (SNR) constraint. In fact, exploiting more bands can cause higher SNR imbalance over multiple bands, which is mainly due to stimulated Raman scattering. To relax these constraints, we propose wavelength-selective band switching-enabled networks (BSNs), where each wavelength channel can be freely switched to any band and in any direction at any optical node on the route. We also present two typical optical node configurations utilizing all-optical wavelength converters, which can realize the switching proposal. Moreover, numerical analyses clarify that our BSN can reduce the fiber resource requirements by more than 20% compared to a conventional multi-band network under realistic conditions. We also discuss the impact of physical-layer performance of band switching operations on available benefits to investigate the feasibility of BSNs. In addition, we report on a proof-of-concept demonstration of a BSN with a prototype node, where C+L-band wavelength-division-multiplexed 112-Gb/s dual-polarization quadrature phase-shift keying signals are successfully transmitted while the bands of individual channels are switched node-by-node for up to 4 cascaded nodes.

Rapid development of modern communications has initiated essential requirements for providing efficient algorithms that can solve the routing and wavelength assignment (RWA) problem in satellite optical networks. In this paper, the bee colony algorithm optimization based on link cost for RWA (BCO-LCRWA) is tailored for satellite networks composed of intersatellite laser links. In BCO-LCRWA, a cost model of intersatellite laser links is established based on metrics of network transmission performance namely delay and wavelengths utilization, with constraints of Doppler wavelength drift, transmission delay, wavelength consistency and continuity. Specifically, the fitness function of bee colony exploited in the proposed algorithm takes wavelength resources utilization and communication hops into account to implement effective utilization of wavelengths, to avoid unnecessary over-detouring and ensure bit error rate (BER) performance of the system. The simulation results corroborate the improved performance of the proposed algorithm compared with the existing alternatives.

This paper proposes a defragmentation scheme using reroutable backup paths in toggled-based quasi 1+1 path protected elastic optical networks (EONs) to improve the efficiency of defragmentation and suppress the fragmentation effect. The proposed scheme can reallocate spectrum slots of backup paths and reroute of backup paths. The path exchange function of the proposed scheme makes the primary paths become the backup state while the backup paths become the primary. This allows utilization of the advantages of defragmentation in both primary and backup paths. We formulate a static spectrum reallocation problem with rerouting (SSRR) in the toggled-based quasi 1+1 path protected EON as an integer linear programming (ILP) problem. The decision version of SSRR is proven to be an NP-complete problem. A heuristic algorithm is introduced to solve the problem for large networks networks where the ILP problem is not tractable. For a dynamic traffic scenario, an approach that suppresses the fragmentation considering rerouting and path exchanging operations is presented. We evaluate the performances of the proposed scheme by comparing it to the conventional scheme in terms of dependencies on node degree, processing time of network operations and interval time between scheduled defragmentations. The numerical results obtained from the performance evaluation indicate that the proposed scheme increases the traffic admissibility compared to the conventional scheme.

The capacity of optical transport networks has been increasing steadily and the networks are becoming more dynamic, complex, and transparent. Though it is common to use worst case assumptions for estimating the quality of transmission (QoT) in the physical layer, over provisioning results in high margin requirements. Accurate estimation on the QoT for to-be-established lightpaths is crucial for reducing provisioning margins. Machine learning (ML) is regarded as one of the most powerful methodological approaches to perform network data analysis and enable automated network self-configuration. In this paper, an artificial neural network (ANN) framework, a branch of ML, to estimate the optical signal-to-noise ratio (OSNR) of to-be-established lightpaths is proposed. It takes account of both nonlinear interference between spectrum neighboring channels and optical monitoring uncertainties. The link information vector of the lightpath is used as input and the OSNR of the lightpath is the target for output of the ANN. The nonlinear interference impact of the number of neighboring channels on the estimation accuracy is considered. Extensive simulation results show that the proposed OSNR estimation scheme can work with any RWA algorithm. High estimation accuracy of over 98% with estimation errors of less than 0.5dB can be achieved given enough training data. ANN model with R=4 neighboring channels should be used to achieve more accurate OSNR estimates. Based on the results, it is expected that the proposed ANN-based OSNR estimation for new lightpath provisioning can be a promising tool for margin reduction and low-cost operation of future optical transport networks.

Network virtualization is viewed as a promising approach to facilitate the sharing of physical infrastructure among different kinds of users and applications. In this letter, we propose a topological consistency-based virtual network embedding (TC-VNE) over elastic optical networks (EONs). Based on the concept of topological consistency, we propose a new node ranking approach, named Sum-N-Rank, which contributes to the reduction of optical path length between preferred substrate nodes. In the simulation results, we found our work contributes to improve spectral efficiency and balance link load simultaneously without deteriorating blocking probability.

This paper considers wide-sense nonblocking operation of the Wavelength-Space-Wavelength elastic optical switch. Six control algorithms, based on functional spectrum decomposition in interstage links and functional decomposition of center stage switches, are proposed for two switching fabric architectures. For these algorithms we derived wide-sense nonblocking conditions and compared them with strict-sense nonblocking ones. The results show that the proposed algorithm reduces the required number of frequency slot units (FSUs) or center stage switches, depending on the switching fabric architecture. Savings occur even when connections use small number of frequency slot units.

We numerically investigate a PDM-QPSK multi-rate coherent burst-mode optical receiver capable of receiving 3 different line-rates, suitable for next generation optical networks such as hybrid optical circuit switching (OCS)/optical packet switching (OPS) networks, access networks and datacenter networks. The line-rate detection algorithm relies on a simple-to-generate optical header, it is based on the fast Fourier transform (FFT) which can be efficiently implemented with the Goertzel algorithm, and it is insensitive to polarization rotations and frequency offset. Numerically, we demonstrate that performance in terms of packet detection rate (PER) can be tailored by controlling the sizes of the packet header and the line-rate estimator.

This paper presents past and recent trends of optical networks and addresses the future directions. First, we describe path networks with the historical backgrounds and trends. path networks have advanced by using various multiplexing technologies. They include time-division multiplexing (TDM), asynchronous transfer mode (ATM), and wavelength-division multiplexing (WDM). ATM was later succeeded to multi-protocol label switching (MPLS). Second, we present generalized MPLS technologies (GMPLS). In GMPLS, the label concept of MPLS is extended to other labels used in TDM, WDM, and fiber networks. GMPLS enables network operators to serve networks deployed by different technologies with a common protocol suite of GMPLS. Third, we describe multi-layer traffic engineering and a path computation element (PCE). Multi-layer traffic engineering designs and controls networks considering resource usages of more than one layer. This leads to use network resources more efficiently than the single-layer traffic engineering adopted independently for each layer. PCE is defined as a network element that computes paths, which are used for traffic engineering. Then, we address software-defined networks, which put the designed network functions into the programmable data plane by way of the management plane. We describe the evaluation from GMPLS to software defined networking (SDN) and transport SDN. Fifth, we describe the advanced devices and switches for optical networks. Finally, we address advances in networking technologies and future directions on optical networking.

A flexible orthogonal frequency-division multiplexing optical network enables the bandwidth to be flexibly changed by changing the number of sub-carriers. We assume that users request to dynamically change the number of sub-carriers. Dynamic bandwidth changes allow the network resources to be used more efficiently but each change takes a significant amount of time to complete. Service centric resource allocation must be considered in terms of the waiting time needed to change the number of sub-carriers. If the user demands drastically increase such as just after a disaster, the waiting time due to a chain-change of bandwidth becomes excessive because disaster priority telephone services are time-critical. This paper proposes a Grouped-elastic spectrum allocation scheme to satisfy the tolerable waiting time of the service in an optical fiber link. Spectra are grouped to restrict a waiting time in the proposed scheme. In addition, the proposed scheme determines a bandwidth margin between neighbor spectra to spectra to prevent frequent reallocation by estimating real traffic behavior in each group. Numerical results show that the bandwidth requirements can be minimized while satisfying the waiting time constraints. Additionally measurement granularity and channel alignment are discussed.

A novel resilient coarse granularity optical routing network architecture that adopts finely granular protection and finely granular add/drop is presented. The routing scheme defines optical pipes such that multiple optical paths can be carried by each pipe and can be dropped or added at any node on the route of a pipe. The routing scheme also makes it possible to enhance frequency utilization within pipes, by denser path packing in the frequency domain, as we recently verified. We develop a static network design algorithm that simultaneously realizes the independence of working and backup paths and pipe location optimization to efficiently carry these paths. The design algorithm first sequentially accommodates optical paths into the network, then tries to eliminate sparsely utilized fibers and iteratively optimizes frequency slot/wavelength assignment in each coarse granular pipe so as to limit the impairment caused by dropping the optical paths adjacent in the frequency domain. Numerical experiments elucidate that the number of fibers in a network can be reduced by up to 20% for 400Gbps channels without any modification in hardware.

This paper describes mobile backhaul optical access network designs for future cellular systems, in particular, for those systems that exploit coordinated multipoints (CoMP) transmission/reception techniques. Wavelength-division-multiplexing passive optical networks (WDM-PON) are primarily considered and two proposals to enhance mobile backhaul capability of WDM-PONs for CoMP are presented. One is physical X2 links that support dedicated low latency and high capacity data exchange between base stations (BSs). The other is multicasting in WDM-PONs. It effectively reduces data/control transmission time from central node to multiple BSs joining CoMP. Evaluation results verify that the proposed X2 links and the multicasting enable more BSs to join CoMP by enhancing the mobile backhaul capability, which results in improved service quality for users.

In this paper, a novel charge coupled device matched filter (CCD-MF) for Electrical code division multiplexing (ECDM) decoder is proposed and experimentally demonstrated. Simulation results clarify the influence of low charge transfer efficiency (CTE) and the validity of a parallel CCD-MF we proposed. A 15-channel ECDM system using a 2 Gchip/s, 2-parallel CCD-MF is experimentally demonstrated.

We describe a concept and realization of distance-adaptive (DA) resource allocation in spectrum-sliced elastic optical path network (SLICE). We modify the modulation format and cross-connection bandwidth of individual fixed-bit rate optical paths to optimize performance with respect to transmission distance. The shorter paths are allocated a smaller amount of resources which allows reducing the spectrum occupied by the channel. We show in calculation a reduction in required spectral resources of more than 60% when compared to the traditional traffic allocation schemes based on ITU-T grid. The concept is verified experimentally.

This paper discusses a simple and speedy routing method in large-capacity optical Wavelength Division Multiplexing (WDM) networks. The large-capacity WDM network is necessary to accommodate increasing traffic load in future. In this large-capacity WDM network, each link has many fibers and a huge amount of optical data can be transmitted through these fibers simultaneously. Optical path is configured for transmitting optical data by wavelength reservation including routing and wavelength assignment (RWA). Since traditional RWA methods have to treat much information about available wavelengths in each fiber, it is difficult to resolve RWA problem on time. In other words, the electrical processing becomes the bottleneck in the large-capacity WDM network. Therefore, a simple and speedy RWA method is necessary for the large-capacity WDM network. In this paper, we propose the simple and effective RWA method which considers reduced information as Network Map. The objective is to improve the network performance by using multiple fibers effectively. The complex processing is not suitable for data transmission because the switching operation must be done in very short time for one request. In addition to this, it is not practical to collect detailed network information frequently. The proposed wavelength assignment method assigns wavelength more uniformly than traditional method, and therefore, the proposed routing method can select routes without considering detailed information about each wavelength state. The proposed routing method needs only local information and reduced network information. This paper shows that the proposed routing method can get suitable solution for large-capacity optical WDM networks through computer simulations. The proposed RWA method drastically improves the loss probability against other simple RWA methods. This paper also describes two types of optical switches with tunable or fixed wavelength conversions. The wavelength converters with relatively low technology becomes effective with the proposed RWA method in the large-capacity WDM network. This paper reveals that complex routing methods are not necessary for large-capacity optical WDM networks.

A virtualized optical network (VON) is proposed as a key to implementing increased agility and flexibility into the future Internet and applications by providing any-to-any connectivity with the appropriate optical bandwidth at the appropriate time. The VON is enabled by introducing optical transparentization and optical fine granular grooming based on optical orthogonal frequency division multiplexing.

We demonstrate a wavelength division multiplexing passive optical network (WDM-PON) based on wavelength-locked Fabry-Perot laser diodes and thin-film filters. Twelve Fast Ethernet signals are bi-directionally transmitted over the multi-branch optical distribution network (ODN). The ODN has distributed branch nodes and bus networks.

This paper considers optical transport and packet networks and discusses the constraints and solutions in computation of traffic engineering paths. We categorize the constraints into prunable or non-prunable classes. The former involves a simple metric which can be applied for filtering to determine the path. The latter requires a methodic consideration of more complicated network element attributes. An example of this type of constraints is path loss in which the metric can be evaluated only on a path basis, as opposed to simply applying the metric to the link. Another form of non-prunable constraint requires adaptation and common vector operation. Examples are the switching type adaptation and wavelength continuity, respectively. We provide possible solutions to cases with different classes of constraints and address the problem of path computation in support of traffic engineering in multi-layer networks where a set of constrains are concurrently present. The solutions include the application of channel graph and common vector to support switching type adaptation and label continuity, respectively.

In this paper, we examine the Interleaved Polling with Adaptive Cycle Time (IPACT) that was proposed to control upstream traffic for Gigabit Ethernet-PONs, a promising technology for the Fiber To The Home (FTTH). We analyzed the performance for the gated service and the limited service mathematically. To do this, the IPACT protocol was modeled as a polling system and analyzed by using mean-value analysis technique. The traffic arrival rate λ was divided into three regions, and each region was analyzed separately and merged appropriately by using an interpolation method. The average packet delay, average queue size, and average cycle time of both the gated service and the limited service were obtained through the analysis. In order to evaluate the accuracy of the mathematical analysis, discrete event simulation was performed for the IPACT protocol. Simulation results show the accuracy of the mathematical analysis. The analysis results can be widely used in the design of the FTTH system based on EPON, as the performance results in the present study can be obtained in a rather short time. We can design an appropriate system depending on various traffic conditions by adjusting system parameters, such as the number of users N, the maximum transfer window WMAX, and so on.

Wavelength division multiplexing (WDM) technology offers the capability of building wide-area networks with high speed. Reconfigurability is a key feature of a WDM network that enables the network logical topology to change dynamically in response to the changing traffic patterns. There are two important issues involved in the reconfiguration of a network logical topology. One is how to determine the new logical topology corresponding to the current topology. It needs to consider a trade-off between the performance of the new target topology and the cost of the topology transition from the current topology to the new one. The other is how to determine the transition sequence from the current topology to the new one. It needs to control the disruption to the network as less as possible during the reconfiguration process. In this paper, we focus on the latter problem and propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to control the disruption to the network as less as possible during the reconfiguration process. For this purpose, a lightpath is taken as the minimum reconfiguration unit. The proposed algorithms are evaluated by using an NFSNET-like network model with 16 nodes and 25 links. The results show that very simple algorithms provide very small computational complexity but poor performance, i.e., large network disruption, and that an efficient algorithm provides reasonable computational complexity and very good performance. More complex algorithms may improve performance somewhat further but have unrealistically large computational complexity.