Issue No. 06 - June (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.277296
<p>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 an 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. It is suggested that 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.</p>
star graphs; k-ary hypercubes; broadcasting problems; performance; interconnection network.
R. Hughey, "The Cost of Broadcasting on Star Graphs and k-ary Hypercubes," in IEEE Transactions on Computers, vol. 42, no. , pp. 756-759, 1993.