Skip to main content

Research Repository

Advanced Search

Tradeoffs between latency, complexity and load balancing with multicast algorithms

Al-Dubai, Ahmed; Ould-Khaoua, Mohamed; Mackenzie, Lewis


Mohamed Ould-Khaoua

Lewis Mackenzie


The increasing number of collective communication-based services with a mass interest and the parallel increasing demand for service quality are paving the way toward end-to-end QoS guarantees. Although many multicast algorithms in interconnection networks have been widely reported in the literature, most of them handle the multicast communication within limited performance metrics, i.e., either delay/latency or throughput. In contrast, this study investigates the multicast communication within a group of QoS constrains, namely latency, jitter, throughput, and additional traffic caused. In this paper, we present the Qualified Groups (QGs) as a novel path-based multicast algorithm for interconnection networks. To the best of our knowledge, the QG is the first multicast algorithm that considers the multicast latency at both the network and node levels across different traffic scenarios in interconnection networks. Our analysis shows that the proposed multicast algorithm exhibits superior performance characteristics over other well-known path-based multicast algorithms under different operating conditions. In addition, our results show that the QG can significantly improve the parallelism of the multicast communication.


Al-Dubai, A., Ould-Khaoua, M., & Mackenzie, L. (2010). Tradeoffs between latency, complexity and load balancing with multicast algorithms. IEEE Transactions on Computers, 59, 159-173.

Journal Article Type Article
Publication Date 2010-02
Deposit Date Apr 7, 2010
Print ISSN 0018-9340
Publisher Institute of Electrical and Electronics Engineers
Peer Reviewed Peer Reviewed
Volume 59
Pages 159-173
Keywords multicast algorithms; communication technologies; performance metrics; qualified groups; path-based; interconnection;
Public URL
Publisher URL