Performance Evaluation of Shared Mesh Protection in WDM Networks

Authors:
Chadi M. Assi;Ahmad Khalil;Nasir Ghani;Abdallah Shami;Mohamed Ali
Affiliations:
Concordia Institute for Information Systems Engineering, Concordia University;Department of Electrical Engineering, Graduate School of The City University of New York;Department ECE, Tennessee Tech. University;Department EE, Lakehead University;Department of Electrical Engineering, Graduate School of The City University of New York
Venue:
Cluster Computing
Year:
2004

Citing 8
Cited 0

Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks

Routing and Dimensioning in Circuit-Switched Networks
Efficient distributed restoration path selection for shared mesh restoration

IEEE/ACM Transactions on Networking (TON)
A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Computing approximate blocking probabilities for a class of all-optical networks

IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers

IEEE Journal on Selected Areas in Communications
Benefits of wavelength translation in all-optical clear-channel networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorithms for sharable and restorable connections in optical networks. Namely, two distributed path selection algorithms are proposed. The first approach maintains global information on network resource usage to determine link sharability and compute optimal shared paths. The second approach only relies upon local information maintained at each node. Subsequently, we present an analytical model to evaluate the performance of these path selection algorithms and show its accuracy through numerical examples. Results indicate that path selection algorithms that maximally exploit the use of reserved sharable channels do not necessarily result in fast restoration; rather these two optimality criteria can conflict most of the time. Additionally, algorithms that maximally exploit the sharability condition typically result in lower scalability and higher complexity.