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
An optimal greedy heuristic to color interval graphs
Information Processing Letters
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Discrete Applied Mathematics
Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Epidemic Algorithms for Reliable Content-Based Publish-Subscribe: An Evaluation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
SIAM Journal on Computing
On the communication complexity of randomized broadcasting in random-like graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The power of memory in randomized broadcasting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Rapid rumor ramification: approximating the minimum broadcast time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On mixing and edge expansion properties in randomized broadcasting
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
On the bit communication complexity of randomized rumor spreading
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Rumour spreading and graph conductance
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
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
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
IEEE Transactions on Information Theory
Experimental analysis of rumor spreading in social networks
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Hi-index | 0.00 |
This paper considers the quasi-random rumor spreading model introduced by Doerr, Friedrich, and Sauerwald in [SODA 2008], hereafter referred to as the list-based model. Each node is provided with a cyclic list of all its neighbors, chooses a random position in its list, and from then on calls its neighbors in the order of the list. This model is known to perform asymptotically at least as well as the random phone-call model, for many network classes. Motivated by potential applications of the list-based model to live streaming, we are interested in its worst case behavior. Our first main result is the design of an O (m +n logn )-time algorithm that, given any n -node m -edge network G , and any source-target pair s ,t ∈V (G ), computes the maximum number of rounds it may take for a rumor to be broadcast from s to t in G , in the list-based model. This algorithm yields an O (n (m +n logn ))-time algorithm that, given any network G , computes the maximum number of rounds it may take for a rumor to be broadcast from any source to any target, in the list-based model. Hence, the list-based model is computationally easy to tackle in its basic version. The situation is radically different when one is considering variants of the model in which nodes are aware of the status of their neighbors, i.e., are aware of whether or not they have already received the rumor, at any point in time. Indeed, our second main result states that, unless $\mbox{P}=\mbox{NP}$ , the worst case behavior of the list-based model with the additional feature that every node is perpetually aware of which of its neighbors have already received the rumor cannot be approximated in polynomial time within a $(\frac{1}{n})^{\frac{1}{2}-\epsilon}$ multiplicative factor, for any ε 0. As a byproduct of this latter result, we can show that, unless $\mbox{P}=\mbox{NP}$ , there are no PTAS enabling to approximate the worst case behavior of the list-based model, whenever every node perpetually keeps track of the subset of its neighbors which have sent the rumor to it so far.