SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
A guided tour of Chernoff bounds
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
Journal of Computer and System Sciences
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Bisection width of transposition graphs
Discrete Applied Mathematics
The Mathematics of Infectious Diseases
SIAM Review
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Invitation to Discrete Mathematics
Invitation to Discrete Mathematics
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance
IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Messy broadcasting - Decentralized broadcast schemes with limited knowledge
Discrete Applied Mathematics
On the randomness requirements of rumor spreading
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.05 |
One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following robust, simple, and scalable randomized broadcasting protocol: at some time t an information is placed at one of the nodes of a graph G, and in the succeeding steps, each informed node chooses one of its neighbours in G uniformly at random, and sends the information to this neighbour. We show that this algorithm spreads an information to all nodes in a Star graph S"n of dimension n within O(logN) steps, with high probability, where N denotes the number of nodes in S"n. To obtain this result, we first establish lower bounds on the edge expansion of small subsets of nodes. Then we introduce a simple but powerful technique for estimating the runtime of randomized broadcasting by analyzing the protocol described above in the reverse order. Using this technique we can also simplify the analysis of this algorithm in Hypercubes [U. Feige, D. Peleg, P. Raghavan, E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms 1 (4) (1990) 447-460].