Efficient path-based multicast in wormhole-routed mesh networks

The capability of multidestination wormhole allows a message to be propagat ed along any valid path in a wormhole-routed network conforming to the unde rlying base routing scheme. The multicast on the path-based routing model i s highly dependent on the spatial locality of destinations participating in multicasting. Tn this paper, we propose two proximity grouping schemes for efficient multicast in wormhole-routed mesh networks with multidestination capability by exploiting the spatial locality of the destination set. The first grouping scheme, graph-based proximity grouping, is proposed to group the destinations together with locality to construct several disjoint sub- meshes. This is achieved by modeling the proximity grouping problem to grap h partitioning problem. The second one, pattern-based proximity grouping, i s proposed by the pattern classification schemes to achieve the goal of the proximity grouping. By simulation results, we show the renting performance gains over the traditional Hamiltonian-path routing scheme. (C) 2000 Elsev ier Science B.V. All rights reserved.