research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleA priority-based balanced routing scheme for random broadcasting and routing in tori
Bibtex cite IDRACTI-RU1-2003-52
Booktitle 32nd International Conference on Parallel Processing (ICPP 2003)
Series Dept. of Electr. & Comput. Eng
Year published 2003
Month October
Pages 519-526
Publisher Queen's Univ., Kingston, Ont.
Location Kaohsiung, Taiwan
DOI 10.1109/icpp.2003.1240619
We propose a priority-based balanced routing scheme, called the priority STAR routing scheme, which leads to optimal throughput and average delay at the same time for random broadcasting and routing. In particular, the average reception delay for random broadcasting required in n1timesn2times...timesnd tori with ni=O(1), n-ary d-cubes with n=O(1), or d-dimensional hypercubes is O(d+1/(1-rho)). We also study the case where multiple communication tasks for random 1-1 routing and/or random broadcasting are executed at the same time. When a constant fraction of the traffic is contributed by broadcast requests, the average delay for random 1-1 routing required in any d-dimensional hypercube, any n-ary d-cube with n = O(1), and most n1timesn2times...timesnd tori with ni=O(1) are O(d) based on priority STAR. Our simulation results show that the priority-based balanced routing scheme considerably outperform the best previous routing schemes for these networks
Chi-Hsiang, Yeh
Varvarigos, Emmanouel
Eshoul, Abdelhamid
getPDF.pdf (main file)
Publication ID598