Performance of deterministic and adaptive broadcast algorithms in multicomputer networks
by Ahmed Y. Al-Dubai, M. Ould-Khaoua, L.M. Mackenzie
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 4, No. 3/4, 2006

Abstract: This paper examines the performance of broadcast communication on multicomputer networks. Unlike many existing works, this study considers a number of key factors/prosperities, including scalability, parallelism and routing scheme that could greatly affect the service provided by the network to broadcast messages. Both deterministic and adaptive routing schemes have been included in our analysis. Unlike the previous works, this study considers the issue of broadcast latency at both the network and node levels across different traffic scenarios. Extensive simulation results show that both our suggested adaptive and deterministic algorithms exhibit superior performance characteristics under a wide range of traffic conditions.

Online publication date: Thu, 10-Aug-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com