An efficient path-based multicast algorithm for mesh networks

Mackenzie, L.M.; Ould-Khaoua, M.; Al-Dubai, Y.; Al-Dubai, Ahmed; Ould-Khaoua, Mohamed; Mackenzie, Lewis

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.

Citation

Mackenzie, L., Ould-Khaoua, M., Al-Dubai, Y., Al-Dubai, A., Ould-Khaoua, M., & Mackenzie, L. (2003, April). An efficient path-based multicast algorithm for mesh networks. Presented at International Parallel and Distributed Processing Symposium, Nice, France

• Presentation Conference Type: Conference Paper (published)
• Conference Name: International Parallel and Distributed Processing Symposium
• Start Date: Apr 22, 2003
• End Date: Apr 26, 2003
• Publication Date: 2003
• Deposit Date: Dec 16, 2009
• Print ISSN: 1530-2075
• Publisher: Institute of Electrical and Electronics Engineers
• Peer Reviewed: Peer Reviewed
• Pages: 283-290
• Book Title: Proceedings International Parallel and Distributed Processing Symposium
• ISBN: 0769519261
• DOI: https://doi.org/10.1109/ipdps.2003.1213509
• Keywords: multicast communication; multiprocessor interconnection; networks; parallel algorithms; resource allocation; telecommunication traffic; QG algorithm; communication latency; mesh networks; multicast message; parallel algorithm; path-based multicast algo
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3557