Optimal and heuristic algorithms for all-optical group multicast in resource-constrained WDM networks

• Published in: International journal of communication systems Vol. 29; no. 15; pp. 2292 - 2312
• Main Authors: Yang, Wen-Lin, Yang, Chun-Tao, Huang, Yu-Chung
• Format: Journal Article
• Language: English
• Published: Chichester Blackwell Publishing Ltd 01.10.2016; Wiley Subscription Services, Inc
• Subjects: Algorithms; Clients; Computer networks; group multicast; light tree; Multicast; Networks; revenue maximized; sparse splitting; Trees; wavelength assignment; Wavelength division multiplexing; Wavelengths; WDM networks
• ISSN: 1074-5351; 1099-1131
• DOI: 10.1002/dac.3165

Summary Given a sparse‐splitting wavelength‐division multiplexing network with no wavelength converter, we study a group multicast problem that is how to transmit a number of multicast streams from the video server to multiple destinations simultaneously. To avoid the situation that the wavelengths are used up by the first few requests, one wavelength is available for each multicast request. Hence, some of destinations may not be included in the multicast trees because of the lack of wavelengths. Our goal is to construct a number of light trees with conflict‐free wavelengths for multiple requests so that the number of served clients is maximized. This problem is named as the revenue‐maximized and delay‐constrained group multicast routing problem. We first determine a set of multicast trees with the maximum number of served clients, then followed by the wavelength assignment to allocate the minimum number of wavelengths to the resulting trees. In this study, we propose two Integer Linear Programming ILP‐based algorithms for determining the optimal solutions for the light‐tree construction problem and the wavelength assignment problem, respectively. For large‐scale networks, two heuristics are introduced to solve the light‐tree construction problem approximately. A set of simulations are also provided for comparing performances of our algorithms against the other published methods. Copyright © 2016 John Wiley & Sons, Ltd. For sparse‐splitting WDM networks with 100 nodes and 30 multicast requests, the total number of clients (gain) served by the multicast trees computed by the profit and k‐shortest‐path (PKSP) method is at least 20% larger than those found by the other approaches based on greedy, Member‐First, and Member‐Only for various ratios of destinations.