On balancing network traffic in path-based multicast communication

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

Research output: Contribution to journalArticle

9 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 algorithm.

Original languageEnglish
Pages (from-to)805-811
Number of pages7
JournalFuture Generation Computer Systems
Volume22
Issue number7
DOIs
Publication statusPublished - Aug 2006

Fingerprint

Communication

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

On balancing network traffic in path-based multicast communication. / Al-Dubai, Ahmed; Ould-Khaoua, Mohamed; Mackenzie, Lewis.

In: Future Generation Computer Systems, Vol. 22, No. 7, 08.2006, p. 805-811.

Research output: Contribution to journalArticle

@article{3c866f8765d04201a43524cc0fec6ae0,
title = "On balancing network traffic in path-based multicast communication",
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 algorithm.",
author = "Ahmed Al-Dubai and Mohamed Ould-Khaoua and Lewis Mackenzie",
year = "2006",
month = "8",
doi = "10.1016/j.future.2006.02.009",
language = "English",
volume = "22",
pages = "805--811",
journal = "Future Generation Computer Systems",
issn = "0167-739X",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - On balancing network traffic in path-based multicast communication

AU - Al-Dubai, Ahmed

AU - Ould-Khaoua, Mohamed

AU - Mackenzie, Lewis

PY - 2006/8

Y1 - 2006/8

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

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

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

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

U2 - 10.1016/j.future.2006.02.009

DO - 10.1016/j.future.2006.02.009

M3 - Article

VL - 22

SP - 805

EP - 811

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

SN - 0167-739X

IS - 7

ER -