Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.
ASSM: Agent Based Source Specific Multicast Routing Protocol for Wireless Mesh Networks