Abstract
We develop an analytical model of information dissemination for a gossiping protocol that combines both pull and push approaches. With this model we analyse how fast an item is replicated through a network, and how fast the item covers the network. We also determine the optimal size of the exchange buffer, to obtain fast replication. Our results are confirmed by large-scale simulation experiments.
Original language | English |
---|---|
Pages (from-to) | 2288-2303 |
Number of pages | 16 |
Journal | Computer networks |
Volume | 53 |
Issue number | 13 |
DOIs | |
Publication status | Published - 28 Aug 2009 |
Externally published | Yes |
Keywords
- Gossip-based protocols
- Large-scale networks
- Probabilistic analysis