A Distributed Multicast Algorithm for Hypercube Multicomputers
- Additional Document Info
- View All
© 1993 IEEE. This paper proposes a novel distributed multicast algo rithm for hypercubes. Based on our algorithm, any node in a multicast-set can directly initiate a multicast to other nodes in the same set. The Dimension-PArtition Tech nique (DIPAT) is the underlying message routing tech nique. This routing technique is valid only for certain con nected graphs, called DIPAT-graphs whose necessary and sufficient conditions are derived. A heuristic algorithm is developed for construction of DIPAT-graphs. In addition, DIP AT is integrated with a simple spanning tree algorithm to form a hierarchical multicasting graph, which retains a higher level of distributed multicasting capability with a similar level of extra traffic as that of the existing single spanning tree based solutions.
author list (cited authors)