Algorithms for multicast connection under multi-path routing model |
| |
| Authors: | Jun GuXiao-Dong Hu Mu-Hong Zhang |
| |
| Affiliation: | a Department of Computer Science, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China
b Institute of Applied Mathematics, Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing, P.O. Box 2734, China |
| |
| 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. |
| |
| Keywords: | Multicast connection Routing algorithms Network cost Approximation algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
