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

Ahmed Y. Al-Dubai, Mohamed Ould-Khaoua, Lewis M. MacKenzie

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number5184806
Pages (from-to)159-173
Number of pages15
JournalIEEE Transactions on Computers
Volume59
Issue number2
DOIs
Publication statusPublished - 2010

Fingerprint

Multicast
Load Balancing
Resource allocation
Latency
Trade-offs
Communication
Interconnection Networks
Quality of service
Throughput
Jitter
Traffic
Collective Communication
Path
Service Quality
Performance Metrics
Parallelism
Scenarios
Vertex of a graph

Keywords

  • Communication algorithms
  • Interconnection networks
  • Multicast communication
  • Path-based routing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Trade-Offs between latency, complexity, and load balancing with multicast algorithms. / Al-Dubai, Ahmed Y.; Ould-Khaoua, Mohamed; MacKenzie, Lewis M.

In: IEEE Transactions on Computers, Vol. 59, No. 2, 5184806, 2010, p. 159-173.

Research output: Contribution to journalArticle

@article{bd2bcd97a620432d80894e5b6c2591aa,
title = "Trade-Offs between latency, complexity, and load balancing with multicast algorithms",
abstract = "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.",
keywords = "Communication algorithms, Interconnection networks, Multicast communication, Path-based routing",
author = "Al-Dubai, {Ahmed Y.} and Mohamed Ould-Khaoua and MacKenzie, {Lewis M.}",
year = "2010",
doi = "10.1109/TC.2009.104",
language = "English",
volume = "59",
pages = "159--173",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

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

AU - Al-Dubai, Ahmed Y.

AU - Ould-Khaoua, Mohamed

AU - MacKenzie, Lewis M.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Communication algorithms

KW - Interconnection networks

KW - Multicast communication

KW - Path-based routing

UR - http://www.scopus.com/inward/record.url?scp=75149114578&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=75149114578&partnerID=8YFLogxK

U2 - 10.1109/TC.2009.104

DO - 10.1109/TC.2009.104

M3 - Article

AN - SCOPUS:75149114578

VL - 59

SP - 159

EP - 173

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 2

M1 - 5184806

ER -