Research Output

On balancing network traffic in path-based multicast communication

  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 algorithm.

  • Type:

    Article

  • Date:

    30 November 2005

  • Publication Status:

    Published

  • Publisher

    Elsevier

  • DOI:

    10.1016/j.future.2006.02.009

  • ISSN:

    0167-739X

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    621.389 Computer engineering

Citation

Al-Dubai, A., Ould-Khaoua, M. & Mackenzie, L. (2005). On balancing network traffic in path-based multicast communication. Future Generation Computer Systems. 22, 805-811. doi:10.1016/j.future.2006.02.009. ISSN 0167-739X

Authors

Keywords

multicast path-based algorithm; qualified groups; parallelism; traffic load; dual-path; multiple-path; column-path algorithm;

Available Documents