Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and their unpredictable behavior (e.g., churn, crashes etc.) may introduce relevant bias. Current implementations of the Peer Sampling Service are designed to provide uniform samples only in static settings and do not consider that biased samples can directly affect the correctness of algorithms relying on a uniformity property or be exploited by a malicious adversary to increase the effectiveness of its attacks to the system. In this paper we provide a practical solution to the biasing problem by deploying a fully distributed Peer Sampling Correction Module on top of a given, possibly biased, peer sampling service. Samples provided by the peer sampling service will be locally processed by this module, using computationally efficient hashing functions, before getting to the application. The effectiveness of our approach is evaluated through an extensive simulation-based study. © 2010 IEEE.
Practical Uniform Peer Sampling under Churn / Baldoni, Roberto; Platania, Marco; Querzoni, Leonardo; Scipioni, Sirio. - (2010), pp. 93-100. (Intervento presentato al convegno 9th International Symposium on Parallel and Distributed Computing, ISPDC 2010 tenutosi a Istanbul, Turkey nel 7 July 2010 through 9 July 2010) [10.1109/ispdc.2010.25].
Practical Uniform Peer Sampling under Churn
BALDONI, Roberto;PLATANIA, MARCO;QUERZONI, Leonardo;SCIPIONI, Sirio
2010
Abstract
Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and their unpredictable behavior (e.g., churn, crashes etc.) may introduce relevant bias. Current implementations of the Peer Sampling Service are designed to provide uniform samples only in static settings and do not consider that biased samples can directly affect the correctness of algorithms relying on a uniformity property or be exploited by a malicious adversary to increase the effectiveness of its attacks to the system. In this paper we provide a practical solution to the biasing problem by deploying a fully distributed Peer Sampling Correction Module on top of a given, possibly biased, peer sampling service. Samples provided by the peer sampling service will be locally processed by this module, using computationally efficient hashing functions, before getting to the application. The effectiveness of our approach is evaluated through an extensive simulation-based study. © 2010 IEEE.File | Dimensione | Formato | |
---|---|---|---|
VE_2010_11573-226496.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
371.7 kB
Formato
Adobe PDF
|
371.7 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.