Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Wavelength requirements for multicasting in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
Multicast routing and wavelength assignment in multihop optical networks
IEEE/ACM Transactions on Networking (TON)
Low-cost, delay-bounded point-to-multipoint communication to support multicasting over WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing algorithm for multicast under multi-tree model in optical networks
Theoretical Computer Science
A survey of optical multicast over WDM networks
Computer Communications
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
On a new multicasting approach in optical burst switched networks
IEEE Communications Magazine
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
Efficient routing and wavelength assignment for multicast in WDM networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
A survey of multicasting protocols for broadcast-and-select single-hop networks
IEEE Network: The Magazine of Global Internetworking
Optical burst switching: a new area in optical networking research
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Multicast is an important application in all-optical WDM networks. The wavelength assignment problem for WDM multicast is to assign a set of wavelengths to the links of a given multicast tree. In an all-optical WDM network without wavelength conversions, wavelength assignment is the key to guarantee the quality of service and to reduce communication costs. In this paper, we study wavelength assignment for WDM multicast with two criteria, to cover the maximum number of destinations, and to minimize the wavelength costs. The computational complexity of the problem is studied. Three heuristic algorithms are proposed and the worst-case approximation ratios for some heuristic algorithms are given. We also derive a lower bound of the minimum total wavelength cost and an upper bound of the maximum number of reached destinations. The efficiency of the proposed heuristic algorithms and the effectiveness of the derived bounds are verified by the simulation results.