Abstract
DHT based p2p systems are appeared to provide scalable storage services with idle resource from many unreliable clients. If a DHT is used in storage intensive applications where data loss must be minimized, quick replication is especially important to replace lost redundancy on other nodes in reaction to failures. To achieve this easily, the simple replication method directly uses the consistent set such as the leaf set and the successor list. However, this set is tightly coupled to the current state of nodes and the traffic needed to support this replication can be high and bursty under churn.
This paper explores efficient replication methods that only glimpse the consistent set to select a new replica. We propose two types of replication methods : Quorum based replication and Availability based replication. The replicas are loosely coupled to the consistent set and can eliminate the compulsory replication under churn. Results from a simulation study suggest that our methods can reduce network traffic enormously and achieve high data availability in a DHT based p2p storage system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM 2001 (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing, UCB Technical Report UCB/CSD-01-114 (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM 2001 (2001)
Druschel, P., Rowstron, A.: PAST: A large-scale, persistent peer-to-peer storage utility. In: Proceedings of HotOS VIII (May 2001)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proceedings of SOSP 2001(October 2001)
Saroiu, S., et al.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of MMCN 2002 (2002)
Kim, K., Park, D.: Efficient and Scalable Client Clustering For Web Proxy Cache. IEICE Transaction on Information and Systems E86-D(9) (September 2003)
Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.M.: Total Recall: System Support for Automated Availability Management. In: Proceedings of NSDI 2004 (2004)
Bhagwan, R., Savage, S., Voelker, G.M.: Replication Strategies for Highly Available Peer-to-peer Storage Systems. In: Proceedings of FuDiCo (June 2002)
Blake, C., Rodrigues, R.: High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two. In: Proceedings of HotOS-IX (May 2003)
Bhagwan, R., Savage, S., Voelker, G.M.: Understanding Availability. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, K., Park, D. (2006). Reducing Data Replication Overhead in DHT Based Peer-to-Peer System. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_94
Download citation
DOI: https://doi.org/10.1007/11847366_94
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)