Salma Ktari
ABSTRACT
This paper presents a comparative analysis of replication algorithms for DHT (Distributed Hash Table) architectures. These algorithms are applicable to all existing structured peer-to-peer systems, and can be implemented on top of any DHT. The performance of these algorithms is examined using emulation through virtualization. Significant differences are identified in terms of delays, control overhead, success rate, and overlay route length.
- Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, 'Wide-area ooperative storage with CFS', In Proc. 18th ACM Symposium on Operating System Principles, pages 202--215, October 21--24, 2001, Chateau Lake Louise, Banff, Alberta, Canada. Google Scholar
Digital Library
- John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, 'OceanStore: Architecture for Global-Scale Persistent Storage', Appears in Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000. Google ScholarDigital Library
- Rubén Mondéjar, Pedro García, Carles Pairot, 'Bunshin: DHT for distributed applications'. Spain 2005.Google Scholar
- Antony Rowstron, Peter Druschel, 'Storage management and caching in PAST, a large-scale persistent peer-to-peer storage utility', 18th ACM SOSP'01, Lake Louise, Alberta, Canada, October 2001. Google ScholarDigital Library
- Antony Rowstron, and Peter Druschel, 'Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems', 18 Conference on Distributed Systems Platforms, Heidelberg (D), 2001 Google ScholarDigital Library
- Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph, 'Tapestry: An Infrastructure for fault-tolerant Wide-area Location and Routing', April 2001.Google Scholar
- Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp1, Scott Shenker, 'A Scalable Content-Addressable Network', in Processings of the ACM SIGCOMM, 2001, pp. 161--172 Google ScholarDigital Library
- Petar Maymounkov and David Mazieres, 'Kademlia: A Peer-to-peer Information System Based on the XOR Metric', in Processings of the IPTPS, Cambridge, MA, USA, February 2002, pp. 53--65. Google ScholarDigital Library
- Ion Stoicay, Robert Morrisz, David Liben-Nowellz, David R. Kargerz, M. Frans Kaashoekz, Frank Dabekz, Hari Balakrishnanz, 'Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications', IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17--32, 2003. Google ScholarDigital Library
- Antony Rowstron, Anne-Marie Kermarrec, Miguel Castro, and Peter Drusche, 'SCRIBE: The design of a large-scale event notification infrastructure', in Proceedings of the Third International Workshop on Networked Group Communications (NGC2001), London, UK, November 2001, pp. 30--43. Google ScholarDigital Library
- Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, John D. Kubiatowicz, 'Bayeux : An Architecture for Scalable and Faulttolerant Widearea Data Dissemination', in Proceedings of the 11th internationalworkshop on Network and operating systems support for digital audioand video, 2001, pp. 11--20. Google ScholarDigital Library
- Predrag Knezevic, Andreas Wombacher, Thomas Risse, 'Enabling High Data Availability in a DHT', in 2nd International Workshop on Grid and Peer-to-peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems (GLOBE), 2005Google Scholar
- Ali Ghodsi, Luc Onana Alima, and Seif Haridi; 'Symmetric Replication for Structured Peer-to-Peer Systems', The 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing, July 2005, Trondheim, Norway. Google ScholarDigital Library
- Predrag Knezevic, Andreas Wombacher, and Thomas Risse, 'DHT-based Self-adapting Replication Protocol for Achieving High Data Availability', in The InternationalConference on Signal-image Technology and Internetbased Systems (SITIS), 2006.Google Scholar
- Marcel Waldvogel, Paul Hurley, Daniel Bauer, 'Dynamic Replica Management in Distributed Hash Tables', Published in: RZ3502 in 2003.Google Scholar
- Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker, 'Search and Replication in Unstructured Peer-to-Peer Networks', In Proceedings of the 16th annual ACM International Conference on supercomputing, 2002. Google ScholarDigital Library
- Kei Ohnishi, Hiroshi Yamamotoy, Kento Ichikawa, Masato Uchida and Yuji Oiey, 'Storage Load Balancing via Local Interactions Among Peers in Unstructured P2P Networks', Proceedings of the 1st international conference on Scalable information systems. Google ScholarDigital Library
- Edith Cohen and Scott Shenker. 'Replication strategies in unstructured peer-to-peer networks'. In ACM SIGCOMM 2002, August 2002. Google ScholarDigital Library
Index Terms
- Performance evaluation of replication strategies in DHTs under churn
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 ...
Evaluation of hierarchical DHTs to mitigate churn effects in mobile networks
This research reviews recent works on flat DHTs under high churn.This research evaluates a flat DHT and a hierarchical DHT with or without churn.This research assesses the performance of two HDHTs with or without churn. Existing flat peer-to-peer (P2P) ...
Churn: A Key Effect on Real-World P2P Software
ICPP '13: Proceedings of the 2013 42nd International Conference on Parallel ProcessingChurn refers to a large number of arriving and departing participants within a short time in peer-to-peer (P2P) networks. This paper studies the impact of churn on real-world unstructured P2P networks. To this end, we need collecting snapshots of P2P ...
Comments