Academic
Publications
An Analytical Model of Information Dissemination for a Gossip-Based Protocol

An Analytical Model of Information Dissemination for a Gossip-Based Protocol,10.1007/978-3-540-92295-7_29,Computer Networks and Isdn Systems,Rena Bakh

An Analytical Model of Information Dissemination for a Gossip-Based Protocol   (Citations: 7)
BibTex | RIS | RefWorks Download
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 large-scale simulation experiments.
Journal: Computer Networks and Isdn Systems - CN , vol. 53, no. 13, pp. 230-242, 2009
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.
    • ...In [3], we have proposed a modelling framework for gossip-based information dissemination protocol, in which each node periodically selects a random peer and shuffles its local data...
    • ...[3]), and for fast event-based 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 Bakhshiet al. A Modeling Framework for Gossip-based 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 Masciet al. Dependability Analysis of Diffusion Protocols in Wireless Networks wit...

    • ...The problem presented below has been described already in the context of a gossip-based 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 Bakhshiet al. How Probable is it to Discard an Ace of Hearts?

Sort by: