Multicast Wavelength Assignment with Sparse Wavelength Converters to Maximize the Network Capacity using ILP formulation in WDM Mesh Networks

DOI

10.2991/jcis.2006.312How to use a DOI?

Keywords

multicast routing and wavelength assignment (MC-RWA), network capacity, integer linear program (ILP), optical networks.

Abstract

We have studied the multicast routing and wavelength assignment (MC-RWA) problem in this paper, and focused on maximizing the network capacity and minimizing the resources used by a multicast session. We show that a multicast wavelength assignment problem is quite different from a unicast wavelength assignment problem. For a general multicast tree, the multicast wavelength assignment to maximize the network capacity is NP-hard. We have presented a heuristic wavelength assignment algorithm with two cost functions to maximize the network capacity. The first cost function has a time complexity of , but it cannot get a satisfactory improvement on the second cost function, which is simply developed from the idea of the Best-Fit technique with time complexity of in memory management or even a worse performance with increasing traffic load. The proposed algorithm tries to find an optimal combination of lightpaths and light-trees to serve a multicast request, and aims at maximizing the network capacity and reducing the wavelength resources. We will simulate this model to prove its performance in the future.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - San-Nan Lee
PY  - 2006/10
DA  - 2006/10
TI  - Multicast Wavelength Assignment with Sparse Wavelength Converters to Maximize the Network Capacity using ILP formulation in WDM Mesh Networks
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.312
DO  - 10.2991/jcis.2006.312
ID  - Lee2006/10
ER  -