Abstract
Dynamic replication can be used to reduce bandwidth consumption and access latency in high performance “data grids” where users require remote access to large files. Different replication strategies can be defined depending on when, where, and how replicas are created and destroyed. We describe a simulation framework that we have developed to enable comparative studies of alternative dynamic replication strategies. We present preliminary results obtained with this simulator, in which we evaluate the performance of five different replication strategies for three different kinds of access patterns. The data in this scenario is read-only and so there are no consistency issues involved. The simulation results show that significant savings in latency and bandwidth can be obtained if the access patterns contain a small degree of geographical locality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Acharya, S., Zdonik, S.B.: An efficient scheme for dynamic data replication: Technical report CS-93-94-43, Brown University
Baentsc, M., et al.: Quantifying the overall impact of caching and replication in the web. University of Kaiserslautern February (1997)
Bestavros, A., Cunha, C: Server-initiated document dissemination for the WWW. IEEE Data Engineering Bulletin, Vol. 19 (1996) 3–11
Bestavros, A.: Demand-based document dissemination to reduce traffic and balance load in distributed information systems. IEEE symposium on Parallel and Distributed Processing, San Antonio, TX (1995)
Bhatacharjee, S., Calvert, K.L., Zegura, E.: Self-organizing wide-area network caches. Georgia Institute of Technology GIT-CC-97/31(1997)
Chervenak, A., Foster, I., Kesselman, C, Salisbury, C, Tuecke, S.: The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Data Sets. J. Network and Computer Applications (2000)
Chuang, J.C.I., Sirbu, M.A.: Distributed Network Storage with Quality-of-Service Guarantees. Proc. INET99 (1999)
Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. ACM SIGCOMM (1998)
Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann (1999)
Foster, I., Kesselman, C, Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. Intl. J. Supercomputer Applications, (to appear).
GriPhyN: The Grid Physics Network Project http://www.griphvn.oro
Gwertzman, J., Seltzer, M.: The case for geographical push-caching. 5th Annual Workshop on Hot Operating Systems (1995)
Holtman, K.: HEPGRID2001: A Benchmark for Virtual Data Grid Schedulers. http://kholtman.home.cern.ch/kholtman/tmp/benchv3.ps
Michel, S., Nguyen, K., Rosenstein, A., Zhang, L., Floyd, L., Jacobson, V.: Adaptive Web Caching: Towards a New Global Caching Architecture. Proceedings of the 3rd International WWW Caching Workshop (1998)
Rabinovich, M., Aggarwal, A.: RaDaR: A scalable architecture for a global Web hosting service. The 8th Int. World Wide Web Conf, May (1999)
Samar, A., Stockinger, H.: Grid Data Management Pilot (GDMP): A Tool for Wide Area Replication. IASTED International Conference on Applied Informatics, Innsbruck, Austria (2001)
Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication algorithm. ACM transactions on Database Systems (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ranganathan, K., Foster, I. (2001). Identifying Dynamic Replication Strategies for a High-Performance Data Grid. In: Lee, C.A. (eds) Grid Computing — GRID 2001. GRID 2001. Lecture Notes in Computer Science, vol 2242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45644-9_8
Download citation
DOI: https://doi.org/10.1007/3-540-45644-9_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42949-4
Online ISBN: 978-3-540-45644-5
eBook Packages: Springer Book Archive