Algorithms for multicast connection under multi-path routing model

CSpace > 应用数学研究所

	Algorithms for multicast connection under multi-path routing model
	Gu, J ; Hu, XD; Zhang, MH
	2002-10-16
发表期刊	INFORMATION PROCESSING LETTERS
ISSN	0020-0190
卷号	84 期号:1 页码:31-39
摘要	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. (C) 2002 Elsevier Science B.V. All rights reserved.
关键词	multicast connection routing algorithms network cost approximation algorithms
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Information Systems
WOS记录号	WOS:000178033500005
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17071
专题	应用数学研究所
通讯作者	Hu, XD
作者单位	1.Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Gu, J,Hu, XD,Zhang, MH. Algorithms for multicast connection under multi-path routing model[J]. INFORMATION PROCESSING LETTERS,2002,84(1):31-39.
APA	Gu, J,Hu, XD,&Zhang, MH.(2002).Algorithms for multicast connection under multi-path routing model.INFORMATION PROCESSING LETTERS,84(1),31-39.
MLA	Gu, J,et al."Algorithms for multicast connection under multi-path routing model".INFORMATION PROCESSING LETTERS 84.1(2002):31-39.