Please use this identifier to cite or link to this item: http://hdl.handle.net/2381/4776
Title: A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks
Authors: Cheng, Hui
Wang, Xingwei
Yang, Shengxiang
Huang, Min
First Published: Mar-2009
Publisher: Elsevier
Citation: Applied Soft Computing, 2009, 9 (2), pp. 677-684.
Abstract: In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.
DOI Link: 10.1016/j.asoc.2008.09.008
ISSN: 1568-4946
Links: http://www.sciencedirect.com/science/article/pii/S1568494608001397
http://hdl.handle.net/2381/4776
Type: Article
Rights: This is the author's final draft of the paper published as Applied Soft Computing, 2009, 9 (2), pp. 677-684. The final version is available from http://www.sciencedirect.com/science/journal/15684946. Doi: 10.1016/j.asoc.2008.09.008
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
ASC-revision-2.pdf123.4 kBAdobe PDFView/Open


Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.