DocumentCode
2164680
Title
Multi-node broadcasting in hypercubes and star graphs
Author
Tseng, Yu-Chee
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan
fYear
1997
fDate
10-12 Dec 1997
Firstpage
51
Lastpage
58
Abstract
In a hypercube or a star graph, given an unknown number of nodes located at unknown positions each intending to broadcast a message, we propose an efficient routing algorithm to solve this problem using asymptotically optimal or near-optimal transmission time
Keywords
hypercube networks; telecommunication network routing; asymptotically optimal transmission time; hypercubes; multi-node broadcasting; near-optimal transmission time; routing algorithm; star graph; star graphs; Broadcast technology; Broadcasting; Computer networks; Computer science; Delay; Hypercubes; Large-scale systems; Multiprocessor interconnection networks; Parallel processing; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on
Conference_Location
Melbourne, Vic.
Print_ISBN
0-7803-4229-1
Type
conf
DOI
10.1109/ICAPP.1997.651479
Filename
651479
Link To Document