AN OPTIMAL BROADCASTING ALGORITHM WITHOUT MESSAGE REDUNDANCY IN STAR GRAPHS

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Electrical Engineering > journal & Dissertation > Item 987654321/29372

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29372

Title:	AN OPTIMAL BROADCASTING ALGORITHM WITHOUT MESSAGE REDUNDANCY IN STAR GRAPHS
Authors:	SHEU,JP;WU,CT;CHEN,TS
Contributors:	電機工程研究所
Keywords:	INTERCONNECTION NETWORKS;COMMUNICATION
Date:	1995
Issue Date:	2010-06-29 20:23:02 (UTC+8)
Publisher:	中央大學
Abstract:	Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O(nlog(2)n) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O(mlog(2)n + nlog(2)n) time due to the nonredundant property of our broadcasting algorithm.
Relation:	IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Appears in Collections:	[Graduate Institute of Electrical Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	478	View/Open

社群 sharing