Distributed end-host multicast algorithms for the Knowledge Grid

doi:10.1002/cpe.1146

CORC > 计算技术研究所 > 中国科学院计算技术研究所 > 中国科学院计算技术研究所期刊论文 > 英文

	Distributed end-host multicast algorithms for the Knowledge Grid
	Tu, Wanqing ; Muppala, Jogesh K.; Zhuge, Hai
刊名	CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
	2007-10-01
卷号	19 期号:15 页码:2013-2029
关键词	end-host multicast P2P networks the Knowledge Grid query
ISSN号	1532-0626
DOI	10.1002/cpe.1146
英文摘要	The Knowledge Grid built on top of the peer-to-peer (P2P) network has been studied to implement scalable, available and sematic-based querying. In order to improve the efficiency and scalability of querying, this paper studies the problem of multicasting queries in the Knowledge Grid. An in-dimensional irregular mesh is a popular overlay topology of P2P networks. We present a set of novel distributed algorithms on top of an m-dimensional irregular mesh overlay for the short delay and low network resource consumption end-host multicast services. Our end-host multicast fully utilizes the advantages of an in-dimensional mesh to construct a two-layer architecture. Compared to previous approaches, the novelty and contribution here are: (1) cluster formation that partitions the group members into clusters in the lower layer where cluster consists of a small number of members; (2) cluster core selection that searches a core with the minimum sum of overlay hops to all other cluster members for each cluster; (3) weighted shortest path tree construction that guarantees the minimum number of shortest paths to be occupied by the multicast traffic; (4) distributed multicast routing that directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel, without a global control; the routing scheme enables the packets to be transmitted to the remote end hosts within short delays through some common shortest paths; and (5) multicast path maintenance that restores the normal communication once the membership alteration appears. Simulation results show that our end-host multicast can distributively achieve a shorter delay and lower network resource consumption multicast services as compared with some well-known end-host multicast systems. Copyright (C) 2006 John Wiley & Sons, Ltd.
WOS研究方向	Computer Science
语种	英语
出版者	JOHN WILEY & SONS LTD
WOS记录号	WOS:000250074200002
内容类型	期刊论文
源URL	[http://119.78.100.204/handle/2XEOYT63/10989]
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Tu, Wanqing
作者单位	1.Natl Univ Ireland Univ Coll Cork, Dept Comp Sci, Mobile & Internet Syst Lab, Cork, Ireland 2.Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China 3.Chinese Acad Sci, Inst Comp Technol, Key Lab Intelligent Informat Proc, China Knowledge Grid Res Grp, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Tu, Wanqing,Muppala, Jogesh K.,Zhuge, Hai. Distributed end-host multicast algorithms for the Knowledge Grid[J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE,2007,19(15):2013-2029.
APA	Tu, Wanqing,Muppala, Jogesh K.,&Zhuge, Hai.(2007).Distributed end-host multicast algorithms for the Knowledge Grid.CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE,19(15),2013-2029.
MLA	Tu, Wanqing,et al."Distributed end-host multicast algorithms for the Knowledge Grid".CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 19.15(2007):2013-2029.