TY - GEN
T1 - Design and analysis of multicast communication in multidimensional mesh networks
AU - Al-Dubai, Ahmed
AU - Ould-Khaoua, Mohamed
AU - Romdhani, Imed
PY - 2007
Y1 - 2007
N2 - This paper addresses the issue of multicast communication in scalable interconnection networks, using path-based scheme. Most existing multicast algorithms either assume a fixed network size, low dimensional networks or only consider the latency at the network level. As a consequence, most of these algorithms implement multicast in a sequential manner and can not scale well with the network dimensions or the number of nodes involved. Furthermore, most of these algorithms handle multicast communication with low throughput. In this paper, we propose a multicast algorithm for multidimensional interconnection networks, which is built upon our Qualified Groups QG multicast scheme for ensuring efficient communication irrespective of the network sizes/dimensions or the number of the destination nodes. Unlike the existing works, this study considers the scalability and latency at both the network and node levels so as to achieve a high degree of parallelism. Our results show that the proposed algorithm considerably improves the multicast message delivery ratio, throughput and scalability.
AB - This paper addresses the issue of multicast communication in scalable interconnection networks, using path-based scheme. Most existing multicast algorithms either assume a fixed network size, low dimensional networks or only consider the latency at the network level. As a consequence, most of these algorithms implement multicast in a sequential manner and can not scale well with the network dimensions or the number of nodes involved. Furthermore, most of these algorithms handle multicast communication with low throughput. In this paper, we propose a multicast algorithm for multidimensional interconnection networks, which is built upon our Qualified Groups QG multicast scheme for ensuring efficient communication irrespective of the network sizes/dimensions or the number of the destination nodes. Unlike the existing works, this study considers the scalability and latency at both the network and node levels so as to achieve a high degree of parallelism. Our results show that the proposed algorithm considerably improves the multicast message delivery ratio, throughput and scalability.
KW - Mesh networks
KW - Path-based multicast
KW - Routing algorithms
UR - http://www.scopus.com/inward/record.url?scp=38149137974&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149137974&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74742-0_77
DO - 10.1007/978-3-540-74742-0_77
M3 - Conference contribution
AN - SCOPUS:38149137974
SN - 3540747419
SN - 9783540747413
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 868
EP - 882
BT - Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq
PB - Springer Verlag
T2 - 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
Y2 - 29 August 2007 through 31 August 2007
ER -