Multicast communication in 2-D mesh networks
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Multicast refers to the message delivery from a source node to an arbitrary number of destination nodes in a communication network. The 2D mesh topology has become increasingly popular as interconnection network for multicomputers and distributed systems. Two multicast algorithms are proposed for 2D mesh networks. The computational complexity of the algorithms is analyzed. The performance of the proposed algorithms is evaluated by intensive simulations. A comparison between the proposed algorithms and two existing algorithms is given.Keywords
This publication has 7 references indexed in Scilit:
- Rectilinear Steiner tree construction by local and global refinementPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Deadlock-free multicast wormhole routing in 2-D mesh multicomputersIEEE Transactions on Parallel and Distributed Systems, 1994
- Multicast communication in multicomputer networksIEEE Transactions on Parallel and Distributed Systems, 1993
- A survey of wormhole routing techniques in direct networksComputer, 1993
- New algorithms for the rectilinear Steiner tree problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979