Research Output

A performance study of path based multicast communication algorithms.

  Multicast communication?s history has been driven by many schemes; however, a few have shown their efficiency on interconnection networks. Among these schemes, path based multicast has been proven to be more efficient in handling multicast, than those classified either as unicast based or tree-based schemes. This paper, therefore, focuses on path based scheme, examining some well-known path-based algorithms. Many experiments have been conducted to evaluate these algorithms in various operating scenarios and traffic conditions. The relative strengths, weaknesses and applicability of each algorithm to diverse situations are discussed. Our results have shown the superiority of our proposed QG algorithms against some of the well know multicast algorithms.

  • Type:

    Book Chapter

  • Date:

    30 November 2005

  • Publication Status:

    Published

  • Publisher

    IEEE Computer Society

  • DOI:

    10.1109/PARELEC.2006.7

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Al-Dubai, A. & Romdhani, I. (2005). A performance study of path based multicast communication algorithms. In International Symposium on Parallel Computing in Electrical Engineering (PARELEC 2006), 245-250. IEEE Computer Society. doi:10.1109/PARELEC.2006.7. ISBN 0-7695-2554-7

Authors

Keywords

multicast communication; interconnection networks; path-based; unicast; tree-based; QG algorithms;

Available Documents