Skip to Main content Skip to Navigation

Epidemic dissemination algorithms in large-scale networks: comparison and adaption to topologies

Ruijing Hu 1 
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Information dissemination (broadcast) is essential for numerous distributed applications. This must be efficient, which limits the message redundancy, and ensures high reliability as well as low latency. We consider here the distributed algorithms that benefitting from the properties of the underlying topologies. Nonetheless, these properties and the parameters in the algorithms are heterogeneous. Thus, we should find a method to fairly compare them. First of all, we study the probabilistic protocols for information dissemination (gossip) executed over three random graphs. The three graphs represent the typical topologies of large-scale topologies: Bernoulli graph, the random geometric graph, and scale-free graph. In order to fairly compare their performance, we propose a new generic parameter: effectual fanout. For a given topology and algorithm, the effectual fanout characterizes the mean dissemination power of infected sites. Furthermore, it simplifies the theoretical comparison of different algorithms over one topology. After having understood the impact of topologies and algorithms on the performance, we propose an efficient reliable algorithm for scale-free topologies.
Complete list of metadata
Contributor : Ruijing Hu Connect in order to contact the contributor
Submitted on : Wednesday, January 15, 2014 - 5:49:08 PM
Last modification on : Friday, January 21, 2022 - 3:22:07 AM
Long-term archiving on: : Wednesday, April 16, 2014 - 4:34:04 AM


  • HAL Id : tel-00931796, version 1


Ruijing Hu. Epidemic dissemination algorithms in large-scale networks: comparison and adaption to topologies. Modeling and Simulation. Université Pierre et Marie Curie - Paris VI, 2013. English. ⟨tel-00931796⟩



Record views


Files downloads