An efficient path-based multicast algorithm for mesh networks

A. Yassin Al-Dubai; M. Ould-Khaoua; L. M. Mackenzie

doi:10.1109/IPDPS.2003.1213509

An efficient path-based multicast algorithm for mesh networks

A. Yassin Al-Dubai, M. Ould-Khaoua, L. M. Mackenzie

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

15 Citations (Scopus)

Abstract

This paper presents a new multicast path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-path, multiple-path, and column-path algorithms.

Original language	English
Title of host publication	Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)	0769519261, 9780769519265
DOIs	https://doi.org/10.1109/IPDPS.2003.1213509
Publication status	Published - 2003
Event	International Parallel and Distributed Processing Symposium, IPDPS 2003 - Nice, France Duration: Apr 22 2003 → Apr 26 2003

Other

Other	International Parallel and Distributed Processing Symposium, IPDPS 2003
Country/Territory	France
City	Nice
Period	4/22/03 → 4/26/03

ASJC Scopus subject areas

Computational Theory and Mathematics
Theoretical Computer Science
Software

Access to Document

10.1109/IPDPS.2003.1213509

Cite this

Al-Dubai, AY, Ould-Khaoua, M & Mackenzie, LM 2003, An efficient path-based multicast algorithm for mesh networks. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003., 1213509, Institute of Electrical and Electronics Engineers Inc., International Parallel and Distributed Processing Symposium, IPDPS 2003, Nice, France, 4/22/03. https://doi.org/10.1109/IPDPS.2003.1213509

@inproceedings{0928dd8658fa4f8798fee947f07a0d74,

title = "An efficient path-based multicast algorithm for mesh networks",

abstract = "This paper presents a new multicast path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-path, multiple-path, and column-path algorithms.",

author = "Al-Dubai, {A. Yassin} and M. Ould-Khaoua and Mackenzie, {L. M.}",

year = "2003",

doi = "10.1109/IPDPS.2003.1213509",

language = "English",

isbn = "0769519261",

booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "International Parallel and Distributed Processing Symposium, IPDPS 2003 ; Conference date: 22-04-2003 Through 26-04-2003",

}

TY - GEN

T1 - An efficient path-based multicast algorithm for mesh networks

AU - Al-Dubai, A. Yassin

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2003

Y1 - 2003

N2 - This paper presents a new multicast path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-path, multiple-path, and column-path algorithms.

AB - This paper presents a new multicast path-based algorithm, referred to here as the qualified groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of the multicast message. Results from extensive simulations under a variety of working conditions confirm that the QG algorithm exhibits superior performance characteristics over those of some well-known existing algorithms, such as dual-path, multiple-path, and column-path algorithms.

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

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

U2 - 10.1109/IPDPS.2003.1213509

DO - 10.1109/IPDPS.2003.1213509

M3 - Conference contribution

AN - SCOPUS:84947256357

SN - 0769519261

SN - 9780769519265

BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - International Parallel and Distributed Processing Symposium, IPDPS 2003

Y2 - 22 April 2003 through 26 April 2003

ER -

An efficient path-based multicast algorithm for mesh networks

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this