PeerCube: an Hypercube-based P2P Overlay Robust against Collusion and Churn - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

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.
Fichier principal
Vignette du fichier
PI-1888.pdf (381.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00258933 , version 1 (26-02-2008)
inria-00258933 , version 2 (22-05-2008)

Identifiers

  • HAL Id : inria-00258933 , version 2

Cite

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⟩
223 View
385 Download

Share

Gmail Facebook Twitter LinkedIn More