Issue No.03 - March (1991 vol.40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.76405
<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.
N.-F. Tzeng, "Enhanced Hypercubes", IEEE Transactions on Computers, vol.40, no. 3, pp. 284-294, March 1991, doi:10.1109/12.76405