Skip to main content
Article thumbnail
Location of Repository

Trade-offs between latency, complexity, and load balancing with multicast algorithms

By A.Y. Al Dubai, M. Ould-Khaoua and L.M. 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

Topics: QA75
Publisher: IEEE
Year: 2010
OAI identifier:
Provided by: Enlighten

Suggested articles


  1. (2005). A Recursion-Based Broadcast Paradigm in Wormhole Routed Networks,” doi
  2. (1996). Al-Dubai received the BSc and MSc degrees in computer science from
  3. (2003). An Efficient Path-Based Multicast Algorithm for Mesh Networks,” doi
  4. (1993). Analysis and Simulation of Computer and Telecomm.
  5. (2001). Balancing Traffic Load for Multi-Node Multicast in a Wormhole 2D doi
  6. (2007). Design and Analysis of On-Chip Communication for Network-on-Chip Platforms,”
  7. (2007). Improved Methods for Distribution on k-Dimensional Meshes Using Multi-Installment,” doi
  8. (2003). Interconnection Networks: An Engineering Approach. doi
  9. (1991). Limits on Interconnection Network Performance,” doi
  10. (2005). Multicast Communication in Wormhole-Routed Symmetric Networks with Hamiltonian Cycle doi
  11. (1999). Multidestination Message Passing in Wormhole k-Ary n-Cube Networks with Base Routing Conformed Paths,” doi
  12. (2004). Optimal All-Ports Collective Communication Algorithms for the k-Ary n-Cube Interconnection doi
  13. (2008). Optimal Oblivious Path Selection on the Mesh,” doi
  14. (1997). Path Based Multicast Communication in Wormhole Routed Unidirectional Torus doi
  15. (2009). Practical Deadlock-Free FaultTolerant Routing in Meshes Based on the Planar Network Fault Model,” doi
  16. (1998). Resource Deadlock and Performance of Wormhole Multicast Routing Algorithms,” doi
  17. (1998). Strategies for Path-Based Multicasting in Wormhole-Routed doi
  18. (2000). Time-Step Optimal Broadcasting in 3-D Meshes with doi
  19. (2000). Turn Grouping for Multicast in Wormhole-Routed Mesh Networks Supporting doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.