Journal Article

An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs

IEEE Transactions on Parallel and Distributed Systems (1995) 6(6) 653-658
DOI: 10.1109/71.388046
49Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Based on the Mendia and Sarkars 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. © 1995 IEEE

Author supplied keywords

Cite

CITATION STYLE

APA

Sheu, J. P., Wu, C. T., & Chen, T. S. (1995). An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs. IEEE Transactions on Parallel and Distributed Systems, 6(6), 653–658. https://doi.org/10.1109/71.388046

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free