The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
Document Type
Article
Publication Date
1-1-1993
Abstract
It is shown that, for two common broadcasting problems, a star graph performs better than a k-ary hypercube with a comparable number of nodes only in networks consisting of impractically large numbers of nodes. This result is based on a comparison of the costs of known solutions to the one-to-all broadcast and the complete broadcast problems for each network. The cost of solutions to these common problems is a better indication of the expected performance of an interconnection network than is a comparison of scalar measures such as the diameter and degree. © 1993 IEEE
Publication Title
IEEE Transactions on Computers
Recommended Citation
Graham, S.,
&
Seidel, S.
(1993).
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes.
IEEE Transactions on Computers,
42(6), 756-759.
http://doi.org/10.1109/12.277296
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/10200