50 search results - page 1 / 10 » On the bit communication complexity of randomized rumor spre... |
SPAA
2010
ACM
13 years 4 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
STACS
2012
Springer
12 years 7 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
PODC
2010
ACM
13 years 3 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
Peer-to-Peer overlay networks have proven their efficiency for storing and retrieving data at large scale, but new services are required to take the actual performances of resour...
SIGAL
1990
13 years 8 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...