Routing algorithm for multicast under multi-tree model in optical networks

Authors:
Jun Gu;Xiao-Dong Hu;Xiaohua Jia;Mu-Hong Zhang
Affiliations:
Computer Science Department, Hong Kong University of Science and Technology, Hong Kong;Institute of Applied Mathematics, Chinese Academy of Sciences, P.O. Box 2734, Beijing 100080, China;Computer Science Department, City University of Hong Kong, Hong Kong;Department of IEOR, University of California, Berkeley
Venue:
Theoretical Computer Science
Year:
2004

Citing 7
Cited 13

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computer networks (3rd ed.)

Computer networks (3rd ed.)
Algorithms for multicast connection under multi-path routing model

Information Processing Letters
Light trees: optical multicasting for improved performance in wavelength routed networks

IEEE Communications Magazine
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Power-efficient design of multicast wavelength-routed networks

IEEE Journal on Selected Areas in Communications
Multicast routing algorithms and protocols: a tutorial

IEEE Network: The Magazine of Global Internetworking

Wavelength assignment for multicast in all-optical WDM networks with splitting constraints

IEEE/ACM Transactions on Networking (TON)
Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
An improved approximation algorithm for capacitated multicast routings in networks

Theoretical Computer Science
Inapproximability and approximability of minimal tree routing and coloring

Journal of Discrete Algorithms
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem

Theoretical Computer Science
Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem

Theoretical Computer Science
Improved approximation algorithms for the capacitated multicast routing problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Routing and coloring for maximal number of trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Complexity of minimal tree routing and coloring

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management

Quantified Score

Hi-index	5.24

Visualization

Abstract

To establish a multicast connection in a wavelength routed optical network, two steps are needed under the multi-tree model. One is to construct a set of light-trees rooted at the source node such that in each of them at most a specified number of destination nodes are allowed to receive the data and every destination node must be designated in one of them to receive the data. The other is to assign a wavelength to each of the produced light-trees in such a way that two light-trees must be assigned two distinct wavelengths if they use a common link. In this paper we mainly study how to construct a multicast routing of minimal cost under the multitree model in optical networks, where the routing cost is total costs of the produced light-trees. We propose a 4-approximation algorithm for this NP-hard problem.