Direção de pesquisa : Pierre SENS

Co-supervisão£o : SOPENA Julien

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

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.

Publicações 2012-2013

• 2013
  • R. Hu : “Algorithmes de dissémination épidémiques dans les réseaux à grande échelle : comparaison et adaptation aux topologie”, tese, defesas 02/12/2013, direção de pesquisa Sens, Pierre, co-supervisão£o : Sopena, Julien (2013)
  • R. Hu, J. Sopena, L. Arantes, P. Sens, I. Demeure : “Efficient Dissemination Algorithm for Scale-Free Topologies”, ICPP'13 - 42^th International Conference on Parallel Processing, Lyon, France, pp. 310-319, (IEEE Computer Society) (2013)
  • R. Hu, J. Sopena, L. Arantes, P. Sens, I. Demeure : “Comparaisons équitables des algorithmes de gossip sur les topologies aléatoires à grande-échelle”, ComPAS'2013 - 9^e Conférence Française sur les Systèmes d'Exploitation (CFSE'13), Chapitre français de l'ACM-SIGOPS, GDR ARP, Grenoble, France (2013)
• 2012
  • R. Hu, J. Sopena, L. Arantes, P. Sens, I. Demeure : “Fair Comparison of Gossip Algorithms over Large-Scale Random Topologies”, Reliable Distributed Systems (SRDS), 2012 IEEE 31^st Symposium on, Irvine, California, United States, pp. 331-340, (IEEE Computer Society Press) (2012)