Dynamic multicast routing under delay constraints in WDM networks with heterogeneous light splitting capabilities

Authors:
Ming-Tsung Chen;Shian-Shyong Tseng;B. M. T. Lin
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC;Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC and Department of Information Science and Applications, Asia University, Taichung, Taiwan, ...;Department of Information and Finance Management, National Chiao Tung University, Hsinchu 300, Taiwan, ROC
Venue:
Computer Communications
Year:
2006

Citing 6
Cited 0

Current European WDM deployment trends

IEEE Communications Magazine
Light trees: optical multicasting for improved performance in wavelength routed networks

IEEE Communications Magazine
Research: Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications
Efficient routing and wavelength assignment for multicast in WDM networks

IEEE Journal on Selected Areas in Communications
Routing of multipoint connections

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Because optical WDM networks will be realized as network backbone in the near future, multicasting in WDM networks needs to be supported for various network applications. In this paper, we propose a new dynamic multicast routing problem under delay constraints (DMR-DC) for finding an optimal light-forest with the minimum multicast cost from these links with available wavelengths for routing a multicast request that arrives in random with a given delay bound in a WDM network with heterogeneous light splitting capabilities, where a light-forest is a set of light-trees used to set up switches to route the request. Multicast cost is defined by communication cost ratio and wavelength consumption ratio. The problem is to determine a light-forest with less wavelength consumption and less communication cost. This problem is NP-hard because it can be reduced from the minimum Steiner tree problem. In this paper, we propose an efficient three-phase (generation, refinement, and conversion) solution model to find approximate solutions in a reasonable time.