Emmanuelle Anceaume
Abstract
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.
- M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI), 2002. Google Scholar
Digital Library
- A. Singh, T. Ngan, P. Drushel, and D. Wallach. Eclipse attacks on overlay networks: Threats and defenses. In Proceedings of the Conference on Computer Communications (INFOCOM), 2006.Google ScholarCross Ref
- M. Srivatsa and L. Liu. Vulnerabilities and security threats in structured peer-to-peer systems: A quantitiative analysis. In Proceedings of the 20th Annual Computer Security Applications Conference (ACSAC), 2004. Google ScholarDigital Library
- N. Naoumov and K. W. Ross. Exploiting p2p systems for DDoS attacks. In Proceedings of the International Conference on Scalable Information Systems (Infoscale), 2006. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM, 2001. Google ScholarDigital Library
- I. Stoica, D. Liben-Nowell, R. Morris, D. Karger, F. Dabek, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM, 2001. Google ScholarDigital Library
- P. Druschel and A. Rowstron. Past: A large-scale, persistent peer-to-peer storage utility. In Proceedings of the Workshop on Hot Topics in Operating Systems (HotOS), 2001. Google ScholarDigital Library
- E. Sit and R. Morris. Security considerations for peer-to-peer distributed hash tables. In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2002. Google ScholarDigital Library
- A. Fiat, J. Saia, and M. Young. Making chord robust to Byzantine attacks. In Proceedings of the Annual European Symposium on Algorithms (AESA), 2005. Google ScholarDigital Library
- E. Anceaume, F. Brasileiro, R. Ludinard, and A. Ravoaja. PeerCube: an hypercube-based p2p overlay robust against collusion and churn. In Proceedings of the International Conference on Self-Adaptive and Self-Organizing Systems (SASO), 2008. Google ScholarDigital Library
- K. Hildrum and J. Kubiatowicz. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In Proceedings of the International Symposium on Distributed Computing (DISC), 2003.Google ScholarCross Ref
- B. Awerbuch and C. Scheideler. Towards scalable and robust overay networks. In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2007.Google Scholar
- E. Anceaume, R. Ludinard, B. Sericola, and F. Tronel. Performance analysis of large scale peer-to-peer overlays using markov chains. In Proceedings of the 41st IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2011.Google Scholar
- B. Awerbuch and C. Scheideler. Group spreading: A protocol for provably secure distributed name service. In Proceedings of the 31rst International Colloquium on Automata, Languages and Programming (ICALP), 2004.Google ScholarCross Ref
- P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing churn in distributed systems. In Proceedings of the ACM SIGCOMM, 2006. Google ScholarDigital Library
- J. Douceur. The sybil attack. In Proceedings of the International Workshop on Peer-to-Peer Systems (IPTPS), 2002. Google ScholarDigital Library
- L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4, 1982. Google ScholarDigital Library
- E. Anceaume, F. Castella, R. Ludinard, and B. Sericola. Markov chains competing for transitions: Application to large scale distributed systems. Methodology & Computing in Applied Probability, 2011. DOI: 10.1007/s11009-011-9239-6.Google ScholarDigital Library
- M. Luby. Lt codes. In Proceedings of the 43rd IEEE Annual Symposium on Foundations of Computer Science, 2002. Google ScholarDigital Library
- P. Maymounkov. Online codes. Research Report TR2002-833, New York University, 2002.Google Scholar
- A. Shokrollahi. Raptor codes. IEEE/ACM Transactions on Networking, pages 2551--2567, 2006. Google ScholarDigital Library
Recommendations
Performance evaluation of EpiChord under high churn
PM2HW2N '13: Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networksChurn has a great effect on the performance of structured Peer-to-Peer (P2P) overlays -- specifically in mobile environments, where overlays have to deal with frequent join and leave events of nodes. In this paper, we evaluate the performance of ...
Modeling and evaluating targeted attacks in large scale dynamic systems
DSN '11: Proceedings of the 2011 IEEE/IFIP 41st International Conference on Dependable Systems&NetworksIn this paper we consider the problem of targeted attacks in large scale peer-to-peer overlays. These attacks aimed at exhausting key resources of targeted hosts to diminish their capacity to provide or receive services. To defend the system against ...
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centralized control, and where nodes can join and leave the distributed system ...
Comments