Abstract
Replication on geographically distributed, unreliable, P2P interconnecting nodes can offer high data availability and low network latency for replica access. The challenge is how to take good control of the number of replicas and their distribution over well-chosen nodes to get a good replica access performance. We observe that, there exists such a logical node cluster overlay over any P2P data-store’s underlying network topology that the replica transmission delay of inter-cluster is much greater than that of intra-cluster because of geographical distance or bandwidth sharing between nodes in different clusters. Based on nodes-clustering, we propose a decentralized algorithm ACB-R to direct the data replication, which can adapt dynamically to the changing replica access patterns or network topologies. The experiment shows that ACB-R can benefit much of the access requests at the price of negligible intra-cluster replica transmission and consequently achieves a good average replica access performance.
This work is supported by the NKBRSF of China (973) under grant No.G1999032705, the National ’863’ High-Tech Program of China under grant No. 2002AA444140.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An Architecture For Global-Scale Persistent Storage. In: Proceedings of ACM ASPLOS, November 2000. ACM, New York (2000)
Druschel, P., Rowstron, A.: PAST: A Large-Scale, Persistent Peer-To-Peer Storage Utility. In: HotOS VIII, Schloss Elmau, Germany, May 2001, pp. 75–80 (2001)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)
Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. Technical Report TR-2001-26, University of Chicago (2001)
Carey, M.J., DeWitt, D.J., Franklin, M.J., Hall, N.E., McAuliffe, M.L., Naughton, J.F., Schuh, D.T., Solomon, M.H., Tan, C.K., Tsatalos, O.G., White, S.J., Zwilling, M.J.: Shoring Up Persistent Applications. In: SIGMOD 1994: Proceedings of the 1994 ACM SIGMOD International Conference on Management Of Data, pp. 383–394. ACM Press, New York (1994)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-Peer Networks. SIGCOMM Comput. Commun. Rev. 32(4), 177–190 (2002)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-To-Peer Networks. In: ICS 2002: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95. ACM Press, New York (2002)
Gray, J., Helland, P., O’Neil, P., Shasha, D.: The dangers of replication and a solution. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 173–182 (1996)
Bhargava, B.K.: Concurrency Control In Database Systems. Knowledge and Data Engineering 11(1), 3–16 (1999)
Ranganathan, K., Iamnitchi, A., Foster, I.: Improving Data Availability Through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities. In: CCGRID 2002: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, Washington, DC, USA, p. 376. IEEE Computer Society Press, Los Alamitos (2002)
Wolfson, O., Jajodia, S., Huang, Y.: An adaptive data replication algorithm. ACM Transactions on Database Systems 22(2), 255–314 (1997)
Bestavros, A.: Demand-based document dissemination to reduce traffic and balance load in distributed information systems. In: Proceedings of SPDP 1995: The 7th IEEE Symposium on Parallel and Distributed Processing, San Anotonio, Texas (1995)
Acharya, S., Zdonik, S.B.: An efficient scheme for dynamic data replication. Technical Report CS-93-43 (1993)
Gwertzman, J.: Autonomous replication in wide-area internetworks. Technical Report TR-17-95, Cambridgem Massachusetts (1995)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Universal topology generation from a user’s perspective. Technical Report 2001-003, 1 (2001)
Rabinovich, M., Rabinovich, I., Rajaraman, R., Aggarwal, A.: A Dynamic Object Replication And Migration Protocol For An Internet Hosting Service. In: International Conference on Distributed Computing Systems, pp. 101–113 (1999)
Cuenca-Acuna, F.M., Martin, R.P., Nguyen, T.D.: Autonomous Replication for High Availability in Unstructured P2P Systems. In: The 22nd IEEE Symposium on Reliable Distributed Systems (SRDS-22), October 2003. IEEE Computer Society Press, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Yang, D., Tang, S. (2005). ACB-R: An Adaptive Clustering-Based Data Replication Algorithm on a P2P Data-Store. In: Grumbach, S., Sui, L., Vianu, V. (eds) Advances in Computer Science – ASIAN 2005. Data Management on the Web. ASIAN 2005. Lecture Notes in Computer Science, vol 3818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596370_11
Download citation
DOI: https://doi.org/10.1007/11596370_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30767-9
Online ISBN: 978-3-540-32249-8
eBook Packages: Computer ScienceComputer Science (R0)