Building a multicasting tree in a high-speed network

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

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

Title:	Building a multicasting tree in a high-speed network
Authors:	Tseng,YC;Juang,TTY;Du,MC
Contributors:	資訊工程研究所
Keywords:	STAR GRAPHS;HYPERCUBES
Date:	1998
Issue Date:	2010-06-29 20:15:22 (UTC+8)
Publisher:	中央大學
Abstract:	To build a multicasting tree in a multicomputer network, the authors propose three strategies based on voting, constructing a minimum spanning tree, and repeatedly constructing multiple minimum spanning trees. Typically, performance metrics to evaluate a multicast solution include time and traffic. Simultaneously optimizing both metrics is computationally intractable because the problem is NP-complete. The first scheme always guarantees the use of the shortest path from the source node to each destination, which makes it time-optimal. The other hva schemes do not guarantee this but try to reduce the traffic as much as possible. To demonstrate these strategies' effectiveness, the authors apply them to hypercubes, star graphs, and star graphs with some faults. They report experimental results to evaluate the performance of these solutions.
Relation:	IEEE CONCURRENCY
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] journal & Dissertation

Files in This Item:

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

社群 sharing