Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/5973
Title: | QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms |
Authors: | Cheng, H Wang, X Yang, S Huang, M Cao, J |
Keywords: | Optical Internet;QoS;Multicast;Ant colony optimization;Artificial immune algorithm |
Issue Date: | 2010 |
Publisher: | Elsevier Ltd. |
Citation: | Journal of Network and Computer Applications, 33(4): 512 - 522, Jul 2010 |
Abstract: | In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet. |
Description: | Copyright @ Elsevier Ltd. All rights reserved. |
URI: | http://www.sciencedirect.com/science/article/pii/S1084804510000056 http://bura.brunel.ac.uk/handle/2438/5973 |
DOI: | http://dx.doi.org/10.1016/j.jnca.2010.01.001 |
ISSN: | 1084-8045 |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 171.9 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.