Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On the second eigenvalue of a graph
Discrete Mathematics
Concentration for Independent Permutations
Combinatorics, Probability and Computing
Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)
Random Graph Dynamics (Cambridge Series in Statistical and Probabilistic Mathematics)
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of 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
On randomized broadcasting in power law networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Rumor spreading and vertex expansion
Proceedings of the twenty-third 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
Asynchronous rumor spreading in preferential attachment graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Mining social networks using wave propagation
Computational & Mathematical Organization Theory
| Hi-index | 0.00 |
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate further the performance of the classical and well-studied push model. Assume that initially one node in a given network holds some piece of information. In each round, every one of the informed nodes chooses independently a neighbor uniformly at random and transmits the message to it. In this paper, we consider random networks where each vertex has degree d ≥ 3, i.e., the underlying graph is drawn uniformly at random from the set of all d-regular graphs with n vertices. We show that with probability 1-o(1) the push model broadcasts the message to all nodes in Cd ln n + ξ rounds, where |&xi| = O((ln ln n)2) and Cd =1/ln(2(1-1/d)) - 1/d ln(1-1/d). In particular, we determine precisely the effect of the node degree to the typical broadcast time of the push model. Moreover, we consider pseudorandom regular networks, where we assume that the degree of each node depends on n. There we show that the broadcast time is (1+o(1))C ln n with probability 1 - o(1), where C = limd→∞ Cd = 1/ln 2+ 1.