The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Exploiting P2P systems for DDoS attacks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
In this paper we present an in-depth study of the dynamicity and robustness properties of large-scale distributed systems, and in particular of peer-to-peer systems. When designing such systems, two major issues need to be faced. First, population of these systems evolves continuously (nodes can join and leave the system as often as they wish without any central authority in charge of their control), and second, these systems being open, one needs to defend against the presence of malicious nodes that try to subvert the system. Given robust operations and adversarial strategies, we propose an analytical model of the local behavior of clusters, based on Markov chains. This local model provides an evaluation of the impact of malicious behaviors on the correctness of the system. Moreover, this local model is used to evaluate analytically the performance of the global system, allowing to characterize the global behavior of the system with respect to its dynamics and to the presence of malicious nodes and then to validate our approach.