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

Rena Bakhshi; Daniela Gavidia; Wan Fokkink; Maarten van Steen

doi:10.1016/j.comnet.2009.03.017

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

Rena Bakhshi^*, Daniela Gavidia, Wan Fokkink, Maarten van Steen

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

22 Citations (Scopus)

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	https://doi.org/10.1016/j.comnet.2009.03.017
Publication status	Published - 28 Aug 2009
Externally published	Yes

Keywords

Gossip-based protocols
Large-scale networks
Probabilistic analysis

Access to Document

10.1016/j.comnet.2009.03.017

Link to publication in Scopus

Fingerprint Dive into the research topics of 'An analytical model of information dissemination for a gossip-based protocol'. Together they form a unique fingerprint.

Cite this

Bakhshi, R., Gavidia, D., Fokkink, W., & van Steen, M. (2009). An analytical model of information dissemination for a gossip-based protocol. Computer networks, 53(13), 2288-2303. https://doi.org/10.1016/j.comnet.2009.03.017

@article{23fc131f648f4f988959165b652c9c8a,

title = "An analytical model of information dissemination for a gossip-based protocol",

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.",

keywords = "Gossip-based protocols, Large-scale networks, Probabilistic analysis",

author = "Rena Bakhshi and Daniela Gavidia and Wan Fokkink and {van Steen}, Maarten",

year = "2009",

month = "8",

day = "28",

doi = "10.1016/j.comnet.2009.03.017",

language = "English",

volume = "53",

pages = "2288--2303",

journal = "Computer networks",

issn = "1389-1286",

publisher = "Elsevier",

number = "13",

}

TY - JOUR

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

AU - Bakhshi, Rena

AU - Gavidia, Daniela

AU - Fokkink, Wan

AU - van Steen, Maarten

PY - 2009/8/28

Y1 - 2009/8/28

N2 - 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.

AB - 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.

KW - Gossip-based protocols

KW - Large-scale networks

KW - Probabilistic analysis

UR - http://www.scopus.com/inward/record.url?scp=67650427144&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2009.03.017

DO - 10.1016/j.comnet.2009.03.017

M3 - Article

AN - SCOPUS:67650427144

VL - 53

SP - 2288

EP - 2303

JO - Computer networks

JF - Computer networks

SN - 1389-1286

IS - 13

ER -