A Performance Study of Path Based Multicast Communication Algorithms

Research Output

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.

Date:

16 October 2006
Publication Status:

Published
Publisher

IEEE Computer Society
DOI:

10.1109/parelec.2006.7
Library of Congress:

QA75 Electronic computers. Computer science

http://researchrepository.napier.ac.uk/output/247525 <p>Al-Dubai, A., & Romdhani, I. (2006). A Performance Study of Path Based Multicast Communication Algorithms. In <i>International Symposium on Parallel Computing in Electrical Engineering (PARELEC 2006)</i>, 245-250. doi:10.1109/parelec.2006.7</p>

Citation

Al-Dubai, A., & Romdhani, I. (2006). A Performance Study of Path Based Multicast Communication Algorithms. In International Symposium on Parallel Computing in Electrical Engineering (PARELEC 2006), 245-250. doi:10.1109/parelec.2006.7