The Community for Technology Leaders
Green Image
Issue No. 03 - March (1991 vol. 40)
ISSN: 0018-9340
pp: 284-294
<p>A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and is guaranteed not to create any traffic-congested points or links. The enhanced hypercube achieves noticeable improvement in diameter, mean internode distance, and traffic density, and it also is more cost effective than a regular hypercube. An efficient broadcast algorithm that can considerably speed up the broadcast process in enhanced hypercubes is provided.</p>
node pairs; connections; unused links; performance measure; traffic distributions; enhanced hypercube; algorithm; diameter; mean internode distance; traffic density; broadcast algorithm; hypercube networks; performance evaluation.
S. Wei, N.-F. Tzeng, "Enhanced Hypercubes", IEEE Transactions on Computers, vol. 40, no. , pp. 284-294, March 1991, doi:10.1109/12.76405
1106 ms
(Ver 3.3 (11022016))