Efficient Dissemination Algorithm for Scale-Free Topologies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Efficient Dissemination Algorithm for Scale-Free Topologies

Abstract

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.
No file

Dates and versions

hal-00839060 , version 1 (27-06-2013)

Identifiers

Cite

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. pp.310-319, ⟨10.1109/ICPP.2013.40⟩. ⟨hal-00839060⟩
163 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More