login
english version rss feed
inria-00305620, version 2
See detailed view  BibTeX  EndNote  TEI  RefWorks
Pacemaker: Fighting Selfishness in Availability-Aware Large-Scale Networks
Fabrice Le Fessant (, http://fabrice.lefessant.net/) 1, Cigdem Sengul (, http://www.irisa.fr/asap/Members/csengul/cigdem-sengul) a1, Anne-Marie Kermarrec () a2
(2008)
Icone de RR-6594.pdf
In this paper, we introduce Pacemaker, a scalable and lightweight protocol to measure reliably the availability of peers. To the best of our knowledge, Pacemaker is the only protocol resilient to the presence of selfish peers, i.e. peers lying about their availability and minimizing their contribution to the system. Pacemaker relies on a novel {\em pulse-based} architecture, where a small set of trusted peers regularly flood the network with pulses containing cryptographic values. Collecting these pulses enables peers to later prove their presence in the system at any time, using cryptographic signatures. This new architecture overcomes many limitations of ping-based systems, and can be easily deployed on ad-hoc networks and social-based topologies. Simulation results show that our protocol provides accurate availability measurements even in the presence of selfish peers. Furthermore, our results are verified by experiments in Planetlab, which also illustrate the deployability of Pacemaker in real networks.
a –  INRIA
1:  ASAP (INRIA Saclay - Ile de France)
INRIA – CNRS : UMR – INSA - Institut National des Sciences Appliquées – Université de Rennes 1
2:  ASAP (INRIA - IRISA)
CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées de Rennes – Université de Rennes 1
Computer Science/Distributed, Parallel, and Cluster Computing
peer-to-peer – cryptography – availability – monitoring
RR-6594