Please use this identifier to cite or link to this item:

Routing and wavelength assignment for WDM multicast networks

Authors He, Jingyi HKUST affiliated (currently or previously)
Chan, Gary Shueng Han View this author's profile
Tsang, Hin Kwok View this author's profile
Issue Date 2001
Source Proceedings IEEE Global Telecommunications Conference, 2001. GLOBECOM '01. Texas, U.S.A. , v. 3,25-29 Nov. 2001, p. 1536-1540
Summary The multicast routing and wavelength assignment (MC-RWA) problem is generally studied with the objective to maximize the number of multicast groups admitted, or equivalently, to minimize the call (or session) blocking probability given a certain number of wavelengths. While this approach is sound, a better objective is to maximize the total number of users served (i.e., minimizing the user blocking probability) by allowing part of a multicast group to be admitted. We present for the first time a formulation of the MC-RWA problem with such an objective. The formulation is a nonlinear integer program, which in general is complex to solve. We hence pro. pose a heuristic algorithm based on linear programming (LP). We further develop a simpler MAX-FIRST algorithm, which achieves almost the same performance as the LP algorithm. These algorithms are for static MC-RWA, where the multicast trees are predetermined and cannot be changed during the wavelength assignment. We extend the algorithms to dynamic MC-RWA, where new multicast trees can be built for unserved groups. We finally present upper and lower bounds on the user blocking probability for the static MC-RWA.
ISSN 1930-529X
ISBN 0780372069
Rights © 2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
00965838.pdf 125565 B Adobe PDF