An optimal broadcasting algorithm without message redundancy in star graphs
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 6 (6) , 653-658
- https://doi.org/10.1109/71.388046
Abstract
[[abstract]]Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O(n log2 n) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O(m log2 n + n log2 n) time due to the nonredundant property of our broadcasting algorithm.[[fileno]]2030224010049[[department]]資訊工程學Keywords
This publication has 0 references indexed in Scilit: