Efficient Dissemination Algorithm for Scale-Free Topologies

Résumé : This paper presents an efficient dissemination algorithm suitable for scale-free random topologies which model some complex real world networks. In these topologies, some sites, denoted hubs, have many more connections than the others. By exploiting then the dissemination power of hubs, we propose a new gossip algorithm where sites directly connected to hubs do not forward received messages. Our algorithm offers a very high reliability and does not require any input parameter value that informs each site if it is a hub or not. Such an information is deduced by every site during the algorithm execution. Compared to well-known probabilistic gossip algorithms, performance simulation results show that our algorithm presents good performance in terms of message complexity and latency.
Type de document :
Communication dans un congrès
ICPP'13 - 42th International Conference on Parallel Processing, Oct 2013, Lyon, France. IEEE Computer Society, pp.310-319, 2013, 〈10.1109/ICPP.2013.40〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00839060
Contributeur : Pierre Sens <>
Soumis le : jeudi 27 juin 2013 - 10:02:44
Dernière modification le : jeudi 11 janvier 2018 - 06:23:38

Identifiants

Collections

Citation

Ruijing Hu, Julien Sopena, Luciana Arantes, Pierre Sens, Isabelle Demeure. Efficient Dissemination Algorithm for Scale-Free Topologies. ICPP'13 - 42th International Conference on Parallel Processing, Oct 2013, Lyon, France. IEEE Computer Society, pp.310-319, 2013, 〈10.1109/ICPP.2013.40〉. 〈hal-00839060〉

Partager

Métriques

Consultations de la notice

223