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
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
A guided tour of Chernoff bounds
Information Processing Letters
Randomized broadcast in networks
SIGAL '90 Proceedings of the international symposium on Algorithms
Adaptive broadcasting with faulty nodes
Parallel Computing
Efficient schemes for nearest neighbor load balancing
Parallel Computing - Special issue on parallelization techniques for numerical modelling
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
On the fault tolerance of some popular bounded-degree networks
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On randomized broadcasting in star graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Brief announcement: the speed of broadcasting in random networks - density does not matter
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Reliable broadcasting in random networks and the effect of density
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient broadcast on random geometric graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading on random regular graphs and expanders
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Asymptotically optimal randomized rumor spreading
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Rumor spreading and vertex expansion
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Randomised broadcasting: memory vs. randomness
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the randomness requirements of rumor spreading
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The worst case behavior of randomized gossip
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Randomised broadcasting: Memory vs. randomness
Theoretical Computer Science
Hi-index | 0.00 |
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it. First, we consider the relationship between randomized broadcasting and random walks on graphs. In particular, we prove that the runtime of the algorithm described above is upper bounded by the corresponding mixing time, up to a logarithmic factor. One key ingredient of our proofs is the analysis of a continuous-type version of the afore mentioned algorithm, which might be of independent interest. Then, we introduce a general class of Cayley graphs, including (among others) Star graphs, Transposition graphs, and Pancake graphs. We show that randomized broadcasting has optimal runtime on all graphs belonging to this class. Finally, we develop a new proof technique by combining martingale tail estimates with combinatorial methods. Using this approach, we show the optimality of our algorithm on another Cayley graph and obtain new knowledge about the runtime distribution on several Cayley graphs.