@article{Karp2000RandomizedRS,
author={Richard M. Karp and Christian Schindelhauer and Scott Shenker and Berthold V{\"o}cking},
journal={Proceedings 41st Annual Symposium on Foundations of Computer Science},
year={2000},
pages={565-574}
}
• Published 12 November 2000
• Computer Science
• Proceedings 41st Annual Symposium on Foundations of Computer Science
Investigates the class of epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose n players communicate in parallel rounds in each of which every player calls a randomly selected communication partner. In every round, players can generate rumors (updates) that are to be distributed among all players. Whenever communication is established…
738 Citations

### On the bit communication complexity of randomized rumor spreading

• Computer Science
SPAA '10
• 2010
Results show that, unlike the case for the message complexity, optimality in terms of both the running time and the bit communication complexity is attainable, except for very small rumor sizes.

### Precise Analysis of Epidemic Algorithms

This work develops a new simple and generic method to analyze randomized rumor spreading processes in fully connected networks that determines the expected rumor spreading time precisely apart from additive constants, which is more precise than almost all previous works.

• Computer Science
ArXiv
• 2018
A new framework for analysis rumor spreading accommodating buffers is proposed, in which a node can process only one push/pull message or push request at a time.

• Computer Science
ICALP
• 2017
A simple and generic method to analyze randomized rumor spreading processes in fully connected networks that determines the expected rumor spreading time precisely apart from additive constants, which is more precise than almost all previous works.

### Asymptotically Optimal Randomized Rumor Spreading

• Computer Science
Electron. Notes Discret. Math.
• 2011

### Randomized Rumour Spreading: The Effect of the Network Topology

• Computer Science, Mathematics
Combinatorics, Probability and Computing
• 2014
This paper considers the popular and well-studied push model, which is used to spread information in a given network with n vertices, and determines the runtime of rumour spreading to be log2n + γ (c)log n with high probability, which implies that the push model is faster on hypercubes than on a random graph G(n, clog n/n), where c is sufficiently close to 1.

### How Asynchrony Affects Rumor Spreading Time

• Computer Science
PODC
• 2016
This paper studies how asynchrony affects the rumor spreading time, that is, the time before a rumor originated at a single node spreads to all nodes in the graph, and shows that for any graph G on n-nodes, the synchronous push-pull protocol needs at most time O(T(G)+log n) to inform all nodes with high probability.

### Simple, Fast and Deterministic Gossip and Rumor Spreading

Besides being the first efficient deterministic solution to the rumor spreading problem this algorithm is interesting in many aspects: It is simpler, more natural, more robust, and faster than its randomized pendant and guarantees success with certainty instead of with high probability.

### Optimal epidemic dissemination

• Computer Science
ArXiv
• 2017
The random phone call model is revisited and it is shown that it is possible to disseminate a rumor to all processes with high probability using $\Theta(\ln n)$ rounds of communication and only $n+o(n)$ messages of size $b$, all of which are asymptotically optimal and achievable with pull and push-then-pull algorithms.

## References

SHOWING 1-10 OF 13 REFERENCES

### On diffusing updates in a Byzantine environment

• Computer Science
Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
• 1999
The first analysis of epidemic-style protocols for such environments is provided, fundamentally different from known analyses for the benign case due to the treatment of fully Byzantine failure-which precludes the use of digital signatures for authenticating forwarded updates.

### Epidemic algorithms in replicated databases (extended abstract)

• Computer Science
PODS '97
• 1997
A variant of the pessimistic algorithm in which locks are released as soon as transactions finish their execution locally is developed, however, this optimistic releasing of locks introduces the possibility of cascading aborts while ensuring serializable executions.

### Epidemic algorithms for replicated database maintenance

• Computer Science
PODC '87
• 1987
This paper descrikrs several randomized algorit, hms for dist,rihut.ing updates and driving t,he replicas toward consist,c>nc,y.

### Accessing Replicated Data in a Large-Scale Distributed System

• Computer Science
Int. J. Comput. Simul.
• 1991
It is found that almost all message failues are either transient or due to long-term host failure, so that retrying messages a few times adds only a small amount to the overall message traffic while improving both access latency and number of messages sent as long as the probability of message failure is small.

### Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

• Computer Science
• 1996
This work presents a special part of this large topic, namely, the part devoted to an abstract study of the dissemination of information in interconnection networks, based on the observation that the communication among processes working in parallel is one of the main parts of the whole parallel computation.

### On the fault tolerance of some popular bounded-degree networks

• Computer Science
Proceedings., 33rd Annual Symposium on Foundations of Computer Science
• 1992
The authors analyze the fault-tolerance properties of several bounded-degree networks and show that an N-node butterfly containing N/sup 1- epsilon / worst-case faults can emulate a fault-free butterfly of the same size with only constant slowdown, becoming the first connected bounded- degree networks known to be able to sustain more than a constant number of worst- case faults.

### Balls and bins: A study in negative dependence

• Economics
Random Struct. Algorithms
• 1998
This paper investigates the notion of negative dependence amongst random variables and attempts to advocate its use as a simple and unifying paradigm for the analysis of random structures and

### A survey of gossiping and broadcasting in communication networks

• Computer Science
Networks
• 1988
Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network that one individual has an item of information which needs to be communicated to everyone else.

### Scalable Update Propagation in Epidemic Replicated Databases

• Computer Science
EDBT
• 1996
Many distributed databases use an epidemic approach to manage replicated data, in which a separate activity performs periodic pair-wise comparison of data item copies to detect and bring up to date obsolete copies.