Algorithms for multicast connection under multi-path routing model

Authors:
Jun Gu;Xiao-Dong Hu;Mu-Hong Zhang
Affiliations:
Department of Computer Science, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China;Department of Computer Science, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China;Institute of Applied Mathematics, Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing, P.O. Box 2734, China
Venue:
Information Processing Letters
Year:
2002

Citing 3
Cited 6

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computer Networks

Computer Networks
Multicast routing algorithms and protocols: a tutorial

IEEE Network: The Magazine of Global Internetworking

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

Theoretical Computer Science
An improved approximation algorithm for capacitated multicast routings in networks

Theoretical Computer Science
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
A 3.4713-approximation algorithm for the capacitated multicast 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

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given a source node and a set of destination nodes in a network, multicast routing problem is usually treated as Steiner tree problem. Unlike this well-known tree based routing model, multicast routing under multi-path model is to find a set of paths rooted at the source node such that in each path at most a fixed number of destination nodes can be designated to receive the data and every destination node must be designated in a path to receive the data. The cost of routing is the total costs of paths found. In this paper we study how to construct a multicast routing of minimal cost under multi-path model. We propose two approximation algorithms for this NP-complete problem with guaranteed performance ratios.