scholarly journals The Recent Contributions of Routing and Spectrum Assignment Algorithms in Elastic Optical Network (EON)

2020 ◽  
Vol 9 (3) ◽  
pp. 2432-2442
Keyword(s):  
Optical Networks ◽  
Single Channel ◽  
Optical Network ◽  
Research Field ◽  
Wavelength Assignment ◽  
High Definition ◽  
Spectrum Assignment ◽  
Cloud Data ◽  
Fiber Technology ◽  
Routing And Spectrum Assignment

The speed is an important aspect of the current generation of Internet users. Currently WDM based optical fiber technology provides a good solution, still it is insufficient for future growth of cloud data centers, social media applications, online gaming, high definition video streaming and broadcasting, etc. The Elastic Optical Networks (EONs) recently added an energetic research field in the fiber-optic network. The EON is next generation of network that can provide flexibly in spectrum, improved service provisioning and accommodate high bandwidth applications in the single channel. In WDM, the Routing and Wavelength Assignment (RWA) is problem, likewise the EON has Routing and Spectrum Assignment (RSA) problem. In RSA problem the frequency slots (FSs) should allocate in continuity and contiguous manner for every demand request. Many research articles are published over the years to find the new feasible solutions for the RSA problem. This paper presents the recent approaches based on routing and spectrum assignment problem and fragmentation schemes which examines and compare the performance, features, and complexity of the approaches. This paper provides merits and demerits of existing approaches in RSA problem and provides more information about the approaches it will help for feature research.

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

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 151
Author(s):  
Michele Flammini ◽  
Gianpiero Monaco ◽  
Luca Moscardelli ◽  
Mordechai Shalom ◽  
Shmuel Zaks
Keyword(s):  
Cost Function ◽  
Optical Networks ◽  
Cost Minimization ◽  
Convex Combination ◽  
Optical Network ◽  
Switching Cost ◽  
Wavelength Assignment ◽  
Intermediate Node ◽  
Polynomial Time Approximation Algorithm ◽  
Path Topology

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.

Routing and spectrum assignment: A metaheuristic for hybrid ordering selection in elastic optical networks

2021 ◽  
pp. 108287
Author(s):  
Henrique A. Dinarte ◽  
Bruno V.A. Correia ◽  
Daniel A.R. Chaves ◽  
Raul C. Almeida
Keyword(s):  
Optical Networks ◽  
Spectrum Assignment ◽  
Routing And Spectrum Assignment

scholarly journals Routing Strategies in Survivable Optical Networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Routing Problem ◽  
Routing Strategy ◽  
Survivable Optical Networks ◽  
Conventional Algorithm ◽  
Better Than

Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking. 

Routing and Spectrum Assignment in Elastic Filterless Optical Networks

2016 ◽  
Vol 24 (6) ◽  
pp. 3578-3592 ◽  
Author(s):  
Emile Archambault ◽  
Nabih Alloune ◽  
Marija Furdek ◽  
Zhenyu Xu ◽  
Christine Tremblay ◽  
...  
Keyword(s):  
Optical Networks ◽  
Spectrum Assignment ◽  
Routing And Spectrum Assignment
Sign in / Sign up

Export Citation Format

Share Document