Multi-hop traffic grooming routing and wavelength assignment using split light trail in WDM all optical mesh networks

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.

Application of Machine Learning in Routing and Wavelength Assignment: Literature Survey

This paper presents the survey of the prominent issue in optical networks is Routing and Wavelength Assignment (RWA), due to the heavy traffic in network, there will be a need for wavelength assignment to the track in that network. The RWA problem is resolved using the approach of Genetic Algorithm and Ant Colony Optimization Algorithm, wherein up until now is noticed to be better than other optimization algorithms. By using Deep Q-Networks, a type of reinforcement learning, in optimizing the problem in selection of the routing path and wavelength assignment in an optical mesh network.

The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation

All-optical networks transmit messages along lightpaths in which the signal is transmitted using the same wavelength in all the relevant links. We consider the problem of switching cost minimization in these networks. Specifically, the input to the problem under consideration is an optical network modeled by a graph G, a set of lightpaths modeled by paths on G, and an integer g termed the grooming factor. One has to assign a wavelength (modeled by a color) to every lightpath, so that every edge of the graph is used by at most g paths of the same color. A lightpath operating at some wavelength λ uses one Add/Drop multiplexer (ADM) at both endpoints and one Optical Add/Drop multiplexer (OADM) at every intermediate node, all operating at a wavelength of λ. Two lightpaths, both operating at the same wavelength λ, share the ADMs and OADMs in their common nodes. Therefore, the total switching cost due to the usage of ADMs and OADMs depends on the wavelength assignment. We consider networks of ring and path topology and a cost function that is a convex combination α·|OADMs|+(1−α)|ADMs| of the number of ADMs and the number of OADMs deployed in the network. We showed that the problem of minimizing this cost function is NP-complete for every convex combination, even in a path topology network with g=2. On the positive side, we present a polynomial-time approximation algorithm for the problem.

WDM Long-Haul Networks

Ever-increasing traffic in the long-haul networks called for WDM-based transmission, all the more when compared to the metro and access segments. Further, although the interconnected WDM rings served the needs of long-haul networks for some time, mesh-connected WDM networks appeared as a natural and more effective solution, with enhanced connectivity and resilience against network failures. In this chapter, we first examine the basic design challenges and the candidate node configurations for WRON-based mesh networks. Next we present various offline design methodologies for this class of networks using LP-based and heuristic schemes. Impact of wavelength conversion (WC) in mesh-configured WRONs is also examined by using analytical models, and the gain in bandwidth utilization is assessed in WRONs with full WC as compared to those without any WC. Finally, we examine some online routing and wavelength assignment schemes that can be used for operational WRONs. (143 words)

A Parallel Strategy for a Genetic Algorithm in Routing Wavelength Assignment Problem Using GPU with CUDA

This paper presents a parallel strategy with a heuristic approach to reduce the execution time bottleneck of a routing and wavelength assignment problem in wavelength-division multiplexing networks of a previous work that uses a sequential genetic algorithm. As the parallelization solution, the GPU hardware processing on CUDA architecture and CUDA C programming language were adopted. The results achieved were between 35 and 40 times faster than the sequential version of the genetic algorithm.