Research Output

An efficient path-based multicast algorithm for mesh networks

  This paper presents a new multicast path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-path, multiple-path, and column-path algorithms.

  • Type:

    Article

  • Date:

    30 November 2002

  • Publication Status:

    Published

  • Publisher

    IEEE Computer Society Press

  • DOI:

    10.1109/IPDPS.2003.1213509

  • ISSN:

    1530-2075

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Al-Dubai, A., Ould-Khaoua, M. & Mackenzie, L. (2002). An efficient path-based multicast algorithm for mesh networks. Proceedings / International Parallel and Distributed Processing Symposium, IPDPS ; sponsors IEEE Computer Society Technical Committee on Parallel Processing, Association for Computing Machinery., 283-290. doi:10.1109/IPDPS.2003.1213509. ISSN 1530-2075

Authors

Keywords

multicast communication; multiprocessor interconnection; networks; parallel algorithms; resource allocation; telecommunication traffic; QG algorithm; communication latency; mesh networks; multicast message; parallel algorithm; path-based multicast algorithm; performance qualified groups; traffic load balancing;

Available Documents