2009
DOI: 10.1016/j.comnet.2009.03.017
|View full text |Cite
|
Sign up to set email alerts
|

An analytical model of information dissemination for a gossip-based protocol

Abstract: 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 spreads in the 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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
25
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 22 publications
(25 citation statements)
references
References 23 publications
0
25
0
Order By: Relevance
“…Another analytic model for gossip-based item dissemination is given in [13]. The model is derived under the assumption of lossless communication, where nodes exhibit homogeneous and uniform behavior over the network.…”
Section: Related Workmentioning
confidence: 99%
“…Another analytic model for gossip-based item dissemination is given in [13]. The model is derived under the assumption of lossless communication, where nodes exhibit homogeneous and uniform behavior over the network.…”
Section: Related Workmentioning
confidence: 99%
“…The model from [2] is also only valid for fully connected networks. In a wireless network, a node can only communicate directly to nodes in its radio range.…”
Section: Introductionmentioning
confidence: 99%
“…Disk-like grid and fully connected mesh networks are also covered by our model, as they are cases of uniformly deployed wireless mesh networks (WMNs). In this paper, we adapt the model from [2] to model the propagation of information for the shuffle protocol on uniformly deployed WMNs. We use a probabilistic state transition system and convergence or steady state characteristics of the shuffle protocol to model propagation of an item in a WMN.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations