PeerCube: an Hypercube-based P2P Overlay Robust against Collusion and Churn

Abstract : In this paper we present PeerCube, a DHT-based system that aims at minimizing performance penalties caused by high churn while preventing malicious peers from subverting the system through collusion. This is achieved by i) applying a clustering strategy to support quorum-based operations; ii) using a randomised insertion algorithm to reduce the probability with which colluding Byzantine peers corrupt clusters, and; iii) leveraging on the properties of PeerCube's hypercube structure to allow operations to be successfully handled despite the corruption of some clusters. Despite a powerful adversary that can inspect the whole system and issue malicious join requests as often as it wishes, PeerCube guarantees robust operations in O(logN) messages, with N the number of peers in the system. Extended simulations validate PeerCube robustness.
Type de document :
[Research Report] PI 1888, 2008, pp.26
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger
Contributeur : Ist Rennes <>
Soumis le : jeudi 22 mai 2008 - 15:22:49
Dernière modification le : vendredi 23 mars 2018 - 13:56:54
Document(s) archivé(s) le : vendredi 25 novembre 2016 - 22:32:23


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00258933, version 2



Emmanuelle Anceaume, Francisco Brasileiro, Romaric Ludinard, Aina Ravoaja. PeerCube: an Hypercube-based P2P Overlay Robust against Collusion and Churn. [Research Report] PI 1888, 2008, pp.26. 〈inria-00258933v2〉



Consultations de la notice


Téléchargements de fichiers