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.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00258933
Contributor : Ist Rennes <>
Submitted on : Thursday, May 22, 2008 - 3:22:49 PM
Last modification on : Friday, November 16, 2018 - 1:22:54 AM
Long-term archiving on : Friday, November 25, 2016 - 10:32:23 PM

File

PI-1888.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00258933, version 2

Citation

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⟩

Share

Metrics

Record views

458

Files downloads

288