By Topic

A novel lightpath rerouting algorithm for dynamic traffic with transmission impairments consideration in WDM all-optical networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Amdouni, N. ; Inf. & Commun. Technol. Dept., Univ. Tunis - El Manar, Tunis, Tunisia ; Koubaa, M. ; Aguili, T.

In this paper, we propose a novel lightpath rerouting algorithm to optimize network resources allocation in WDM all-optical networks in order to set up an incoming lightpath demand to be blocked for lack of resources or due to the absence of a suitable path and a suitable wavelength that meet the minimum Quality of Transmission (QoT) requirements. Indeed, in such networks, transmitted optical signal has to traverse crossconnect switches, fiber segments and optical amplifiers. Thus, while propagating through the network, the signal may degrade in quality as it encounters crosstalk at the cross-connect switches and collects amplified spontaneous emission noise at the optical amplifiers. Since these impairments continue to degrade the signal quality as it progresses toward its destination, the received Bit Error Rate (BER) at the destination node might become unacceptably high. Rerouting aims at reassigning the wavelength and/or the path of one or several established connections in order to free enough wavelengths to satisfy the incoming demand. Rerouting refers implicitly to dynamic traffic. Simulation results show that our algorithm improves the rejection ratio and is less CPU time consuming than rerouting algorithms previously presented in the literature.

Published in:

Computer Systems and Industrial Informatics (ICCSII), 2012 International Conference on

Date of Conference:

18-20 Dec. 2012