Multi-drop path model for multicast routing and wavelength assignment

Authors:
Shuguang Yan;Jitender Deogun
Affiliations:
Department of Computer Science, Prairie View A&M University, P.O. Box 970, Prairie View, TX;Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE
Venue:
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Year:
2003

Citing 5
Cited 2

Multicast tree generation in networks with asymmetric links

IEEE/ACM Transactions on Networking (TON)
Graph theory and its applications

Graph theory and its applications
Efficient Collective Communication in Optical Networks

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Light trees: optical multicasting for improved performance in wavelength routed networks

IEEE Communications Magazine
Power-efficient design of multicast wavelength-routed networks

IEEE Journal on Selected Areas in Communications

QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Journal of Network and Computer Applications
Minimum cost multicast routing based on high utilization MC nodes suited to sparse-splitting optical networks

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of multicast routing and wavelength assignment under the multi-drop path model (MRWA-MP). In a multi-drop path model, multiple paths are employed to establish a multicast session and each path can drop signals at no more than a predefined number of destination nodes. Given a network topology and a multicast session, the MRWA-MP problem is to minimize the number of wavelengths used to establish the multicast session and, as an auxiliary objective, minimize the number of fibers used. We derive bounds for both objectives. The lower bound on the number of wavelengths derived is tighter and thus more accurate than that in recent papers. To gain an insight into the complexity of the MRWA-MP problem, we formulate it as a mixed integer linear programming (MILP) problem and solve it using CPLEX integer optimizer. Our experience indicates that this problem can easily overwhelm even a state-of-the-art computing facility. To solve the MRWA-MP problem efficiently, we develop a heuristic, MFBH, based on the Edmonds-Karp maximum flow algorithm. Through experiments, we show that the MFBH heuristic achieves the lower bound on the number of wavelengths in almost all instances of the real-life and randomly generated networks that we tested. Furthermore, MFBH tends to use fewer fibers when the maximum number of drops allowed on a single path decreases, the number of destination nodes in a multicast session increases, or the connectivity of the network decreases.