A Performance Study of Path Based Multicast Communication Algorithms

Al-Dubai, A.; Romdhani, I.

Abstract

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.

Citation

Al-Dubai, A., & Romdhani, I. (2006, September). A Performance Study of Path Based Multicast Communication Algorithms. Presented at International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)

• Conference Name: International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)
• Start Date: Sep 13, 2006
• End Date: Sep 17, 2006
• Publication Date: Oct 16, 2006
• Deposit Date: Apr 9, 2010
• Publisher: Institute of Electrical and Electronics Engineers
• Peer Reviewed: Peer Reviewed
• Pages: 245-250
• Book Title: International Symposium on Parallel Computing in Electrical Engineering (PARELEC 2006)
• ISBN: 0769525547
• DOI: https://doi.org/10.1109/parelec.2006.7
• Keywords: multicast communication; interconnection networks; path-based; unicast; tree-based; QG algorithms
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3415
• Publisher URL: http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.7