Optimal multicast tree routing for cluster computing in hypercube interconnection networks

IEICE Transactions on Information and Systems, pp. 1625-1632, 2004.

Cited by: 5|Bibtex|Views0|Links
EI WOS SCOPUS
Keywords:
multicast messagesshort end-to-end average delayresource utilizationtrees (mathematics)end-to-end average delayMore(34+)

Abstract:

This paper proposes a set of novel efficient multicast routing algorithms on hypercube interconnections of cluster computers using a multicast shared-tree approach. We present some new algorithms for selecting an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation res...More

Code:

Data:

Your rating :
0

 

Tags
Comments