DocumentCode
1866865
Title
Some heuristics and experiments for building a multicasting tree in a high-speed network
Author
Tseng, Yu-Chee ; Juang, Tong-Ying ; Du, Ming-Chih
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
fYear
1997
fDate
28 Apr-2 May 1997
Firstpage
248
Lastpage
253
Abstract
Proposes three strategies for building a multicasting tree in a high-speed network. These strategies can be used in any network topology. The first one is based on voting, the second based on constructing a minimum spanning tree, and the third based on repeatedly constructing multiple minimum spanning trees. To demonstrate the effectiveness of these strategies, we show how to apply them to hypercubes and star graphs. Experimental results are reported to evaluate the performance of these solutions
Keywords
network topology; performance evaluation; telecommunication channels; telecommunication networks; trees (mathematics); heuristics; high-speed network; hypercubes; minimum spanning trees; multicasting tree; network topology; performance evaluation; repeated construction; star graphs; voting; Computer science; High-speed networks; Hypercubes; Intelligent networks; Network topology; Telecommunication traffic; Time measurement; Traffic control; Tree graphs; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing on the Information Superhighway, 1997. HPC Asia '97
Conference_Location
Seoul
Print_ISBN
0-8186-7901-8
Type
conf
DOI
10.1109/HPC.1997.592155
Filename
592155
Link To Document