PeerCube: an Hypercube-based P2P Overlay Robust against Collusion and Churn - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

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

Résumé

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.
Fichier principal
Vignette du fichier
saso.pdf (183.08 Ko) Télécharger le fichier
Origine Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00916734 , version 1 (13-12-2013)

Identifiants

  • HAL Id : hal-00916734 , version 1

Citer

Emmanuelle Anceaume, Romaric Ludinard, Aina Ravoaja, Francisco Brasiliero. PeerCube: an Hypercube-based P2P Overlay Robust against Collusion and Churn. IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008, France. pp.12. ⟨hal-00916734⟩
230 Consultations
445 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More