scholarly journals Wavelength Assignment Algorithm for optical networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1049-1054
Author(s):  
Gulzar Ahmad Dar ◽  
Hardeep singh Saini
Keyword(s):  
Optical Networks ◽  
Assignment Problem ◽  
Optical Network ◽  
Wavelength Assignment ◽  
Assignment Algorithm ◽  
Better Than

Wavelength assignment problem is one of the important problem in optical networks as on the first stage the route of the optical network is to be selected and after the route is selected then the wavelength is to be assigned to that route. In this paper we have proposed a wavelength assignment technique for the better performance of the optical network. The results have proved it better than the conventional algorithms.

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. 

Path Selection Methods with Multiple Impairment Constraints Based on Flooding Approach in Transparent Optical Networks

2011 ◽  
Vol 230-232 ◽  
pp. 122-125
Author(s):  
Li Rong Wang
Keyword(s):  
Optical Networks ◽  
Optical Network ◽  
Wavelength Assignment ◽  
Path Selection ◽  
Route Selection ◽  
Selection Methods ◽  
Physical Impairments ◽  
Transparent Optical Networks ◽  
Assignment Algorithm ◽  
All Optical

Set out from the evolution of optical network to all optical transparent frame,this paper analyzes the major physical impairments in transparent optical network and their constraints on route selection. A novel impairment-aware routing and wavelength assignment algorithm based on flooding path information message is proposed.

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.

Optical Network Optimization

2013 ◽  
pp. 1-23
Author(s):  
Bin Wang ◽  
Yousef S. Kavian
Keyword(s):  
Network Design ◽  
Optical Networks ◽  
Optimization Problems ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Topology Design ◽  
Wdm Optical Networks ◽  
Design Problems ◽  
Optical Network Design

Optical networks form the foundation of the global network infrastructure; hence, the planning and design of optical networks is crucial to the operation and economics of the Internet and its ability to support critical and reliable communication services. This book chapter covers various aspects of optimal optical network design, such as wavelength-routed Wavelength Division Multiplexing (WDM) optical networks, Spectrum-Sliced Elastic (SLICE) optical networks. As background, the chapter first briefly describes optical ring networks, WDM optical networks, and SLICE optical networks, as well as basic concepts of routing and wavelength assignment and virtual topology design, survivability, and traffic grooming in optical networks. The reader is referred to additional references for details. Many optical network design problems can be formulated as sophisticated optimization problems, including (1) Routing and Wavelength Assignment (RWA) and virtual topology design problem, (2) a suite of network design problems (such as variants of traffic grooming, survivability, and impairment-aware routing), (3) various design problems aimed at reducing the overall energy consumption of optical networks for green communication, (4) various design optimization problems in SLICE networks that employ OFDM technologies. This chapter covers numerous optical network design optimization problems and solution approaches in detail and presents some recent developments and future research directions.

Sign in / Sign up

Export Citation Format

Share Document