Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Efficient collective communication in optical networks
Theoretical Computer Science
Approximation algorithms for directed Steiner problems
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Optical multicast over wavelength-routed WDM networks: A survey
Optical Switching and Networking
ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm
IEEE Journal on Selected Areas in Communications
Power-efficient design of multicast wavelength-routed 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
Optical layer multicast: rationale, building blocks, and challenges
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We study online multicasting in WDM networks with shared light splitter bank. Our objective is to maximize the network throughput. It is desirable that the cost of realizing each multicast request be minimized, and the network throughput will be maximized ultimately through the cost saving on each individual request. We first propose a cost model for realizing an online multicast request under such network environments with limited light splitters and wavelength converters, which models the cost of utilization of network resources, particularly in modelling the light splitting and wavelength conversion ability at nodes. We then show that finding a cost-optimal multicast tree for a multicast request under the proposed cost model is NP-complete, and instead devise approximation and heuristic algorithms for it. We finally conduct experiments to evaluate the performance of the proposed algorithms. The results show that the proposed algorithms are efficient and effective in terms of network throughput.