Lasing cycles in WDM optical networks based on wavelength routing

We study the problem of providing real-time service to hard and soft real-time messages in wavelength division multiplexing (WDM) optical networks. We propose and evaluate a set of scheduling algorithms which schedule message transmissions in single-hop WDM passive star networks based on specific time constraints. We compare the performances of our algorithms with that of the typical WDM scheduling algorithm which does not consider the time constraint of the transmitted messages by discrete-event simulations and an analytical model. We find that the improvement on real-time performance can be attributed to our scheduling algorithms where the time constraint of messages has been taken into consideration. This study suggests that when scheduling real-time messages in WDM networks, one has to consider not only the problem of resources allocation in the network but also the problem of sequencing messages based on their time constraints.

In a many-to-many session, a participant distributes and receives traffic flows to/from all others in the same session. It is desirable to achieve both high resource utilization and low power consumption when such sessions are provisioned. In wavelength division multiplexing (WDM) optical networks, traffic grooming has been widely applied as the key technology for aggregating sessions to improve resource utilization. However, the current many-to-many grooming approaches, the lightpath circle and hubbed light-tree, do not make an effort to reduce the power consumption of many-to-many sessions. In this paper, we formulate the green routing and aggregation of many-to-many sessions problem and prove its NP-completeness. For problem solving in WDM optical networks, we apply a rational combined method of lightpaths. Both an integer linear programming-based approach and a novel graph-based heuristic are devised. We further provide an illustrative comparison between our heuristic and the existing benchmarks in terms of power consumption. Extensive simulation results demonstrate that, compared with the benchmarks, our heuristic improves the average power efficiency in the range of 13-19%.

To utilize the wavelength resources of Internet protocol (IP) over wavelength division multiplexing (WDM) optical networks, a multi-constrained multicast traffic grooming algorithm is proposed in this paper. This algorithm can achieve multicast traffic grooming in IP over WDM optical networks under multi-constraints, including the number of optical transceivers, wavelength conversion capability and wavelength splitting capability. We simulated the traffic grooming algorithm using the topology of GEANT. Emulation results show that our algorithm has a lower blocking proportion compared with the multi-hop traffic grooming algorithm, which can achieve multicast traffic grooming more effectively.

In this paper, we compare performance of fixed-grid Wavelength Division Multiplexing (WDM) and Elastic Optical Networks (EONs) in dynamic provisioning of many-to-many (m2m) flows. Currently, with a growth of services relying on many-to-many communication paradigm such as distributed computing, inter-Data Center communication, content delivery networking or other requiring high-bandwidth in group communication, it is vital to deliver new solutions facilitating these demanding transmissions. Therefore, the authors investigate provisioning of m2m traffic in high-performance optical networks. This work focuses on dynamic Routing and Wavelength Assignment (RWA) problem in WDM networks as well as Routing and Spectrum Allocation (RSA) problem in EONs for m2m flows using replicated communication through auxiliary rendezvous servers.

Elastic optical network (EON) is a promising candidate for the next generation optical transport network because of its high spectrum efficiency and flexible spectrum allocation. However, to migrate from today’s dense wavelength division multiplexing (DWDM) network to EON, optical nodes such as reconfigurable optical add/drop multiplexers (ROADMs) should be replaced with the ones with expensive flexi-grid wavelength selective switches (WSSs). Thus, whether and how today’s optical network will be evolved to EON is still under debate. Meanwhile, with the technical maturity of optical super-channels that transmit bit rates at the level of 1 Tb/s, super-channels are expected to dominate the future optical transport network because of their attractiveness of high spectrum efficiency and superior cost effectiveness. In this paper, we propose a new quasi-coarse wavelength division multiplexing (Quasi-CWDM) optical network architecture that is compatible to today’s WDM network in spectrum operation, while still maintaining the flexibility of adaptation between the bit rate and the transparent reach of an optical super-channel, but not requiring expensive flexi-grid WSSs. Specifically, the Quasi-CWDM optical network employs large fixed frequency grids, whose spacing falls between the traditional CWDM and DWDM, e.g., 200 GHz or 400 GHz. To maintain the flexibility between the bit rate and the transparent reach of an optical super-channel, different modulation formats are chosen according to channel physical distances. To minimize network hardware cost and maximize carried user traffic demand, we develop a mixed integer linear programming (MILP) model and a heuristic algorithm that can efficiently groom upper-layer IP traffic onto the optical layer by optical super-channels. We compare the design based on the Quasi-CWDM network to those based on the DWDM network and the advanced EON. It is found that the proposed Quasi-CWDM network has a much lower hardware cost than the other two types of networks, while achieving spectrum efficiency close to EON.

We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical network with m lightpaths and maximum load L, if NP ≠ ZPP, for any constant δ>0, no polynomial time algorithm can achieve approximation ratio n1/2−δ or m1−δ, where NP is the class of problems which can be solved by nondeterministic polynomial time algorithms, and ZPP is the class of problems that can be solved by polynomial randomized algorithms with zero probability of error. Furthermore, the above result still holds even when L=2. We also prove that no algorithm can guarantee the number of wavelengths to be less than $$(\sqrt{n}/2)L$$ or (m/2)L. This is the first time inapproximability results are established for the wavelength assignment problem in WDM optical networks. We also notice the following fact, namely, there is a polynomial time algorithm for wavelength assignment which achieves approximation ratio of O(m(log log m)2/(log m)3). Therefore, the above lower bound of m1−δ is nearly tight.

In this letter, we propose a computational model for calculating blocking probabilities of multifiber wavelength division multiplexing (WDM) optical networks. We first derive the blocking probability of a fiber based on a Markov chain, from which the blocking probability of a link is derived by means of conditional probabilities. The blocking probability of a lightpath can be computed by a recursive formula. Finally, the network-wide blocking probability can be expressed as the ratio of the total blocked load versus the total offered load. Simulation results for different fiber-wavelength configurations conform closely to the numerical results based on our proposed model, thus demonstrating the feasibility of our proposed model for estimating the blocking performance of multifiber WDM optical networks.

Addresses the problem of efficient communication in unreliable multi-hop optical networks supported by wavelength division multiplexing (WDM). We first define a new cost model for routing in (optical) WDM networks that is more general and realistic than the existing models. Our model takes into consideration not only the cost of wavelength access and conversion but also the cost for wavelength switching when several optical channels of the same wavelength arrive at the same node. We then propose a set of efficient algorithms in both reliable and unreliable WDM networks on the new cost model respectively for each of three important communication patterns-multiple point-to-point routing, multicast and multiple multicast.

The widespread deployment of wireless telecommunication networks and growing Internet traffic globally leads to a substantial increase in signal traffic demands in fiber optic networks. This demand surge places significant pressure on the survivability of optical networks, specifically when faced with fiber cable failures that prevent failed optical fibers from satisfying connection requests. To address this challenge, in this paper, we consider integrated planning of regenerator installation, optical connection routing, and wavelength assignment (RWA) for wavelength division multiplexing (WDM) optical networks under link failures. To the best of our knowledge, we are the first to consider such an integrated problem. We minimize the number of backup regenerators required to fulfill all connection requests under all potential link failures while accounting for the wavelength and routing constraints. We formulate the problem as an integer program, while its size exponentially increases with the network size by nature. To solve large-scale instances for practical uses in the industry, we propose efficient algorithms to generate near-optimal solutions that are practically implementable. We perform extensive numerical experiments to demonstrate the effectiveness of our approach in solving real-world instances provided by our industry partners. The results show that our approach can efficiently obtain high-quality solutions while ensuring a minimal increase in backup regenerators as the network grows. Our solutions also offer valuable insights into planning a cost-effective and reliable fiber optic network for network operators.

In recent years, minimization of add-drop multiplexers (ADMs) in wavelength division multiplexing (WDM) optical networks has gained lots of attention in both the research and commercial areas. This motivates the research presented in this paper. A heuristic algorithm is formulated for static traffic grooming in WDM uni-directional ring networks with an eye to minimize the number of required ADMs. The distinguished feature of the proposed heuristic is that it pairs up the calls of a given static traffic to approach the solution. The proposed heuristic is compared with the previous approach with same network configuration and traffic matrix to establish its effectiveness.

In this work, we investigate the effects of estimation uncertainties in the optimization of the optical signal-to-noise ratio (OSNR) at the wavelength division multiplexing (WDM) optical networks. The OSNR optimization increases the network throughput and energy efficiency and it enables to minimize the number of retransmissions by higher layers. The OSNR optimization algorithms are related to the optical channel estimation performed by the combinations of optical performance monitors (OPM) measurements, analytical models and numerical simulations. Furthermore, the estimation uncertainties are introduced by several factors such as the availability of monitoring information, monitoring accuracy, imperfection of physical layer and dynamic of channel allocation. Our numerical results have demonstrated the relation between the uncertainties in the channel error estimation, normalized mean squared error (NMSE) and power penalty. The developed methodology can be utilized to determinate the maxim level of acceptable uncertainties in the channel error estimation according the power penalty permitted in the OSNR optimization.

This chapter discusses the causes of impairments in the optical network and how one takes them into account in the design, followed by the survivability issues in optical networks. It outlines the basic concepts of survivability and different protection and restoration schemes used in optical networks. Survivability can be provided in different layers in network: logical layers and optical layer. The fault‐management schemes in each layer have their own functionalities and characteristics. The chapter also discusses the survivability in the multilayer wavelength division multiplexing (WDM) optical networks. The protection techniques in the synchronous optical network and synchronous digital hierarchy networks are briefly described, which are still used in many of the current protocols in the WDM networks. It looks at protection functions in the optical layer and discusses how protection functions in the different layers of the network can work together.

The cost of an optical network in wavelength division multiplexing (WDM) networks can be reduced using optical reconfigurable optical add/drop multiplexers (ROADMs), which allow traffic to pass through without the need for an expensive optical-electro-optical (O-E-O) conversion. Waveband switching (WBS) is another technique to reduce the network cost by grouping consecutive wavelengths and switching them together using a single port per waveband. WBS has attracted the attention of researchers for its efficiency in reducing switching complexity and therefore cost in WDM optical networks. In this paper, we consider the problem of switching wavelengths as non-overlapping uniform wavebands, per link, for mesh networks using the minimum number of wavebands. Given a fixed band size b s , we give integer linear programming formulations and present a heuristic solution to minimize the number of ROADMs (number of wavebands) in mesh networks that support a given traffic pattern. We show that the number of ROADMs (or number of ports in band-switching cross-connects) can be reduced significantly in mesh networks with WBS compared to wavelength switching using either the ILP or the heuristic algorithm. We also examine the performance of our band assignment algorithms under dynamic traffic.

Inter-domain path provision under a wavelength continuity constraint (WCC), including path computation and resource reservation procedures, is a major challenge in multi-domain wavelength division multiplexing (WDM) optical networks, because of the requirement for confidentiality between the domains. Based on the hierarchical path computation element (PCE) architecture, this work proposed a path establishment scheme under a WCC to provide a fast inter-domain path establishment solution and decrease the influence of the WCC. The hierarchical PCE architecture consists of a single parent PCE serving as the arbitrator and multiple child PCEs responsible for the child domains. By cooperation between the parent PCE and the child PCEs, both inter-domain path computation and inter-domain wavelength reservation can be processed in parallel to accelerate and optimize WCC lightpath provisioning and thus to reduce the blocking probability. The effectiveness of this solution has been evaluated through simulations. The simulation results show that the proposed solution can achieve lower computation and reservation delays and thus lead to lower blocking probabilities on the multi-domain WCC paths.

In anycast, connection requests are routed to one of multiple destination candidates, thus helping improve the overall acceptance of service requests in the network when compared to traditional unicast. In this paper we develop a new analytical model to compute the network-wide blocking performance for anycast routing and wavelength assignment (ARWA) in wavelength division multiplexing (WDM) optical networks using the reduced-load fixed-point approximation analysis. This model is based on conventional queuing theory for loss systems combined with a joint probability analysis of the anycast service alternatives. Performance results show that our model provides good accuracy compared to simulation results.