Abstract
Large Grid systems not only provide massive aggregated computing power but also an unprecedented amount of distributed storage space. Unfortunately, the dynamic behavior of the Grid, caused by varying resource availability, unpredictable data updates, and the impact of local site policies makes it difficult to exploit the full capabilities of Data Grids.
We present an analytical model for determining the optimal number of replica servers, catalog servers, and catalog sizes to guarantee a given overall reliability in the face of unreliable components. Our model captures the characteristics of peer-to-peer-like environments as well as that of Grid systems. Empirical simulations confirm the accuracy of our analytical model.
References
S. Acharya and S.B. Zdonik, "An Efficient Scheme for Dynamic Data Replication", Brown University CS–93–43, 1993.
A. Adya et al., "Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment", in Proc. of the 5 th OSDI, December 2002.
C. Baru, R. Moore, A. Rajasekar and M. Wan, "The SDSC Storage Resource Broker", in Proc. of CASCON'98, Toronto, Canada, 1998.
S. Bethke et al., "Report of the Steering Group of the LHC Computing Review", Technical Report CERN European Origanization for Nuclear Research, February 2001.
M. Carman, F. Zini, L. Serafini and K. Stockinger, "Towards an Economy-based Optimisation of File Access and Replication on a Data Grid", in Intl. Workshop on Agend-based Cluster and Grid Computing, Proc. of the CCGrid 2002, May 2002, pp. 340–345.
A. Chervenak et al., "Giggle: A Framework for Constructing Scalable Replica Location Services", in Proc. of the IEEE Supercomputing 2002.
K. Czajkowski, S. Fitzgerald, I. Foster and C. Kesselman, "Grid Information Services for Distributed Resource Sharing", HPDC-10, IEEE Computer Society Press, 2001.
R. Dingledine, M.J. Freedman and D. Molnar, "Free Haven", in A. Oram (ed.), Peer-to-Peer: Harnessing the Power of Disruptive Technologies, O'Reilly Books, 2001.
L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem", ACM Computing Surveys, Vol. 14, No. 2, pp. 287–313, 1982.
European Datagrid Project, www.eu-datagrid.org.
E. Deelman, C. Kesselman, R.D. Williams, A. Lazzarini, T.A. Prince, J. Romano and B. Allen, "A Virtual Data Grid for LIGO", Springer LNCS 2110, pp. 3–12, 2002.
A.V. Goldberg and P.N. Yianilos, "Towards an Archival Inter-memory", in IEEE Intl. Conf. Advances in Digital Libraries ADL'98, IEEE Computer Soc. Press, Los Alamitos, CA, 1998, pp. 147–156.
M. Herlihy, "A Quorum-Consensus Replication Method for Abstract Data Types", ACM Transactions on Computer Systems (TOCS), Vol. 4, No. 1, pp. 32–53, 1986.
R. Jiménez-Peris, M. Patiño-Martínez, G. Alonso and B. Kemme, "How to Select a Replication Protocol According to Scalability, Availability and Communication Overhead", in Proc. 20 th Symposium on Reliable Distributed Systems, October 2001.
J. Kubiatowicz et al., "OceanStore: An Architecture for Global-Scale Persistent Storage", ASPLOS 00, MA, USA, 2000.
A. Kumar and A. Segev, "Cost and Availability Tradeoffs in Replicated Data Concurrency Control", ACM Transactions on Database Systems, Vol. 18, No. 1, pp. 102–131, 1993.
R. Ladin, B. Liskov, L. Shrira and S. Ghemawat, "Providing High Availability Using Lazy Replication",ACM Transactions on Computer Systems, Vol. 10, No. 4, pp. 360–391, 1992.
S. Mahmoud and J.S. Riordon, "Optimal Allocation of Resources in Distributed Information Networks", ACM Trans-actions on Database Systems, Vol. 1, No. 1, pp. 66–78, 1976.
Particle Physics Data Grid (PPDG), http://www.ppdg.net/.
K. Ranganathan, A. Iamnitchi and I. Foster, "Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities", in CCGrid2002, IEEE Computer Society, May 2002, pp. 376–381.
S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker, "A Scalable Content-Addressable Network", in ACM SIGCOMM 01, San Diego, CA, USA, 2001.
F. Schintke and A. Reinefeld, "On the Cost of Reliability in Large Data Grids", Technical Report ZR–02–52, Zuse Institute Berlin, December 2002.
F. Schintke, T. Schütt and A. Reinefeld, "A Framework for Self-Optimizing Grids Using P2P Components", in 1st Intl. Workshop on Autonomic Computing Systems (ACS), Prague, September 2003.
T. Schütt, F. Schintke and A. Reinefeld, "Efficient Synchronization of Replicated Data in Distributed Systems", in Intl. Conf. on Computational Science ICCS 2003, LNCS 2657, June 2003, pp. 274–283.
H. Stockinger, A. Samar, B. Allcock, I. Foster, K. Holtman and B. Tierney, "File and Object Replication in Data Grids", Journal of Cluster Computing, Vol. 5, No. 3, pp. 305–314, 2002.
H. Stockinger, K. Stockinger, E. Schikuta and I. Willers, "Towards a Cost Model for Distributed and Replicated Data Stores", in 9 th Euromicro Workshop on Parallel and Distributed Processing PDP 2001, Mantova, Italy, February 7–9, 2001.
H. Stockinger, A. Samar, S. Mufzaffar and F. Donno, "Grid Data Mirroring Package (GDMP)", Scientific Programming Journal, 2002.
I. Stoica, R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications", in ACM SIGCOMM 01, San Diego, CA, USA, 2001.
H. Weatherspoon and J.D. Kubiatowicz, "Erasure Coding vs. Replication: A Quantitative Comparison", in Peer-to-Peer Systems: First International Workshop, IPTPS 2002,LNCS 2429, 2002, pp. 328–337.
O. Wolfson, S. Jajodia and Y. Huang, "An Adaptive Data Replication Algorithm", ACM Transactions on Database Systems, Vol. 22, pp. 255–314, 1997.
H. Yu and A. Vahdat, "The Costs and Limits of Availability for Replicated Services", ACM Operating Systems Review, Vol. 35, No. 5, pp. 29–42, 2001.
B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph and J.D. Kubiatowicz, "Tapestry: A Resilient Global-sale Overlay for Service Deployment", IEEE Journal on Selected Areas in Communicaions, 2003.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schintke, F., Reinefeld, A. Modeling Replica Availability in Large Data Grids. Journal of Grid Computing 1, 219–227 (2003). https://doi.org/10.1023/B:GRID.0000024086.50333.0d
Issue Date:
DOI: https://doi.org/10.1023/B:GRID.0000024086.50333.0d