Journal of Grid Computing

, Volume 1, Issue 2, pp 219–227 | Cite as

Modeling Replica Availability in Large Data Grids

  • Florian Schintke
  • Alexander Reinefeld
Article

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.

data availability data grid distributed replica management peer-to-peer 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Acharya and S.B. Zdonik, "An Efficient Scheme for Dynamic Data Replication", Brown University CS–93–43, 1993.Google Scholar
  2. 2.
    A. Adya et al., "Farsite: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment", in Proc. of the 5 th OSDI, December 2002.Google Scholar
  3. 3.
    C. Baru, R. Moore, A. Rajasekar and M. Wan, "The SDSC Storage Resource Broker", in Proc. of CASCON'98, Toronto, Canada, 1998.Google Scholar
  4. 4.
    S. Bethke et al., "Report of the Steering Group of the LHC Computing Review", Technical Report CERN European Origanization for Nuclear Research, February 2001.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    A. Chervenak et al., "Giggle: A Framework for Constructing Scalable Replica Location Services", in Proc. of the IEEE Supercomputing 2002.Google Scholar
  7. 7.
    K. Czajkowski, S. Fitzgerald, I. Foster and C. Kesselman, "Grid Information Services for Distributed Resource Sharing", HPDC-10, IEEE Computer Society Press, 2001.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    European Datagrid Project, www.eu-datagrid.org.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    J. Kubiatowicz et al., "OceanStore: An Architecture for Global-Scale Persistent Storage", ASPLOS 00, MA, USA, 2000.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    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.Google Scholar
  18. 18.
    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.Google Scholar
  19. 19.
    Particle Physics Data Grid (PPDG), http://www.ppdg.net/.Google Scholar
  20. 20.
    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.Google Scholar
  21. 21.
    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.Google Scholar
  22. 22.
    F. Schintke and A. Reinefeld, "On the Cost of Reliability in Large Data Grids", Technical Report ZR–02–52, Zuse Institute Berlin, December 2002.Google Scholar
  23. 23.
    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.Google Scholar
  24. 24.
    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.Google Scholar
  25. 25.
    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.Google Scholar
  26. 26.
    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.Google Scholar
  27. 27.
    H. Stockinger, A. Samar, S. Mufzaffar and F. Donno, "Grid Data Mirroring Package (GDMP)", Scientific Programming Journal, 2002.Google Scholar
  28. 28.
    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.Google Scholar
  29. 29.
    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.Google Scholar
  30. 30.
    O. Wolfson, S. Jajodia and Y. Huang, "An Adaptive Data Replication Algorithm", ACM Transactions on Database Systems, Vol. 22, pp. 255–314, 1997.Google Scholar
  31. 31.
    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.Google Scholar
  32. 32.
    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.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Florian Schintke
    • 1
  • Alexander Reinefeld
    • 1
  1. 1.Zuse Institute BerlinBerlinGermany

Personalised recommendations