Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Analytical Model
Gossip Protocol
Information Dissemination
Large Scale Simulation
Subscribe
Academic
Publications
An Analytical Model of Information Dissemination for a GossipBased Protocol
An Analytical Model of Information Dissemination for a GossipBased Protocol,10.1007/9783540922957_29,Computer Networks and Isdn Systems,Rena Bakh
Edit
An Analytical Model of Information Dissemination for a GossipBased Protocol
(
Citations: 7
)
BibTex

RIS

RefWorks
Download
Rena Bakhshi
,
Daniela Gavidia
,
Wan Fokkink
,
Maarten Van Steen
We develop an
analytical model
of
information dissemination
for a gossip protocol. With this model we analyse how fast an item is replicated through a network. We also determine the optimal size of the exchange buffer, to obtain fast replication. Our results are confirmed by largescale simulation experiments.
Journal:
Computer Networks and Isdn Systems  CN
, vol. 53, no. 13, pp. 230242, 2009
DOI:
10.1007/9783540922957_29
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
(
dx.doi.org
)
(
www.informatik.unitrier.de
)
More »
Citation Context
(3)
...In [
3
], we have proposed a modelling framework for gossipbased information dissemination protocol, in which each node periodically selects a random peer and shuffles its local data...
...[
3
]), and for fast eventbased simulation, as it is done in this paper...
...Thus, data exchange operations between nodes are generally considered to be atomic operations, e.g., [10], [11], [12], [13], [14], [7], [15], [
3
]...
...We now move on to another case, the Shuffle protocol introduced in [7] and originally analyzed in [
3
] using our framework...
...The transition probabilities can be easily computed, see Fig. 6. For more details on derivation of these transition probabilities, we refer to [
3
]...
...To derive the expression for �� drop, we assume a uniform distribution of items over the network; in the absence of message loss, this assumption is supported by experiments in [7], [23], [
3
] and analysis in [24]...
...Thus, �� drop ≈ �� −�� �� −�� . This approximation of �� drop for Shuffle has been successfully established through experiments [
3
], and used for modelling and optimization in [3], [4]...
...Thus, �� drop ≈ �� −�� �� −�� . This approximation of �� drop for Shuffle has been successfully established through experiments [3], and used for modelling and optimization in [
3
], [4]...
Rena Bakhshi
,
et al.
A Modeling Framework for Gossipbased Information Spread
...In [
3
] and [2], the wireless network is modelled with n identical stochastic processes, and mathematical techniques are employed to tackle complexity for large networks...
Paolo Masci
,
et al.
Dependability Analysis of Diffusion Protocols in Wireless Networks wit...
...The problem presented below has been described already in the context of a gossipbased protocol [
3
]...
...Sections 3.1 and 3.2 repeat the analysis done in [
3
], while Section 3.3 contributes new material to this paper...
Rena Bakhshi
,
et al.
How Probable is it to Discard an Ace of Hearts?
References
(16)
Formal analysis techniques for gossiping protocols
(
Citations: 17
)
Rena Bakhshi
,
François Bonnet
,
Wan Fokkink
,
Boudewijn R. Haverkort
Journal:
Operating Systems Review  SIGOPS
, vol. 41, no. 5, pp. 2836, 2007
Epidemic Information Dissemination in Distributed Systems
(
Citations: 156
)
Patrick Th. Eugster
,
Rachid Guerraoui
,
Annemarie Kermarrec
,
Laurent Massoulié
Journal:
IEEE Computer  COMPUTER
, vol. 37, no. 5, pp. 6067, 2004
A Gossipbased Distributed News Service for Wireless Mesh Networks
(
Citations: 23
)
Daniela Gavidia
,
Spyros Voulgaris
Conference:
Wireless on Demand Network Systems and Service  WONS
Gossipbased peer sampling
(
Citations: 124
)
Márk Jelasity
,
Spyros Voulgaris
,
Rachid Guerraoui
,
Annemarie Kermarrec
,
Maarten Van Steen
Journal:
ACM Transactions on Computer Systems  TOCS
, vol. 25, no. 3, pp. 8es, 2007
Randomized rumor spreading
(
Citations: 254
)
Richard M. Karp
,
Christian Schindelhauer
,
Scott Shenker
,
B. Vocking
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 565574, 2000
Sort by:
Citations
(7)
Meanfield framework for performance evaluation of pushpull gossip protocols
(
Citations: 2
)
Rena Bakhshi
,
Lucia Cloth
,
Wan Fokkink
,
Boudewijn R. Haverkort
Journal:
Performance Evaluation  PE
, vol. 68, no. 2, pp. 157179, 2011
A Modeling Framework for Gossipbased Information Spread
(
Citations: 1
)
Rena Bakhshi
,
Daniela Gavidia
,
Wan Fokkink
,
Maarten van Steen
Conference:
Quantitative Evaluation of Systems  QEST
, vol. abs/1105.5, 2011
Dependability Analysis of Diffusion Protocols in Wireless Networks with Heterogeneous Node Capabilities
(
Citations: 2
)
Paolo Masci
,
Silvano Chiaradonna
,
Felicita Di Giandomenico
Conference:
European Dependable Computing Conference  EDCC
, pp. 145154, 2010
Uniform and Ergodic Sampling in Unstructured PeertoPeer Systems with Malicious Nodes
Emmanuelle Anceaume
,
Yann Busnel
,
Sébastien Gambs
Conference:
International Conference On Principles Of DIstributed Systems  OPODIS
, pp. 6478, 2010
On the Impact of Modelling Choices for Distributed Information Spread
(
Citations: 1
)
Rena Bakhshi
,
Ansgar Fehnker
Conference:
Quantitative Evaluation of Systems  QEST
, pp. 4150, 2009