Brief Announcement: Induced Churn to Face Adversarial Behavior in Peer-to-Peer Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A comparative study of rateless codes for P2P persistent torage
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
Adaptive link recovery scheme for structured peer-to-peer networks under churn
Proceedings of the 2011 ACM Symposium on Applied Computing
Performance evaluation of large-scale dynamic systems
ACM SIGMETRICS Performance Evaluation Review
Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This paper presents PeerCube, a DHT-based system aiming 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 randomized 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. In spite of 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.