Skip to main content
SpringerLink
Log in

A Novel Dynamic Replication Algorithm in Hierarchical Data Grid

  • Conference paper
  • First Online:
Computer Science and Convergence

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 114))

  • 1335 Accesses

Abstract

Data grid provides massive aggregated computing resources and distributed storage space to deal with data-intensive applications. Due to limitation of available resources in grid as well as production the large number of workloads, efficient use of the grid resources becomes important challenge. Replication provides decreased bandwidth consumption, improved fault tolerance, and enhanced scalability. Although replication is a key technique, but the problem of selecting proper locations for placing replicas i.e. best replica placement in Data Grid has not been widely studied, yet. In this paper a modified three-layer hierarchical replication algorithm is proposed for dynamic creation of replicas, replica selection and especially replica placement which selects best location. The simulation and experiment results show the proposed replication strategy outperforms over current strategies about 14%. contain at least 70 and at most 150 words. It should be set in nine-point font size and should be inset 1.0 cm from the right and left margins. There should be two blank (10-point) lines before and after the abstract. This document is in the required format.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Figueira S, Trieu T (2008) Data replication and the storage capacity of data grids. Springer, Berlin, Heidelberg, pp 567–575

    Google Scholar 

  2. Lamehamedi H, Szymanski B, Shentu Z, Deelman E (2002) Data replication strategies in grid environments.In: Proceedings of the 5th international conference on algorithms and architectures for parallel processing, pp 378–383

    Google Scholar 

  3. Cameron D, Millar A, Nicholson C, Carvajal-Schiaffino R, Stockinger K, Zini F (2004) Analysis of scheduling and replica optimisation strategies for data grids using OptorSim. J Grid Comput 2:57–69

    Article  Google Scholar 

  4. Foster I, Kesselman C, Tuecke S (2001) The anatomy of the Grid: enabling scalable virtual organizations. Int J High Perform Comput Appl 15:200–222

    Article  Google Scholar 

  5. Baker M, Buyya R, Laforenza D (2002) Grids and grid technologies for wide-area distributed computing. Softw Pract Exper 32:1437–1466

    Article  MATH  Google Scholar 

  6. Chervenak A, Schuler R, Kesselman C, Koranda S, Moe B (2005) Wide area data replication for scientific collaborations. In: Proceedings of the 6th international workshop on grid computing, pp 1–8

    Google Scholar 

  7. David WB (2003) Evaluation of an economy-based file replication strategy for a data grid. International workshop on agent based cluster and grid computing, pp 120–126

    Google Scholar 

  8. Deris M, Abawaji J, Suzuri H (2004) An efficient replicated data access approach for large-scale distributed systems.In: IEEE international symposium on cluster computing and the grid

    Google Scholar 

  9. Ranganathan K, Iamnitchi A, Foster I (2002) Improving data availability through dynamic model-driven replication in large peer-to-peer communities. In 2nd IEEE/ACM international symposium on cluster computing and the grid, pp 376–381

    Google Scholar 

  10. Chang R, Chang J, Lin S (2007) Job scheduling and data replication on data grids. Futur Gener Comput Syst, Elsevier, 23: 846–860

    Google Scholar 

  11. Abdi S, Pedram H, Mohamadi S (2010) The impact of data replication on job scheduling performance in hierarchical data grid. Int J Appl Graph Theory in Wireless Ad hoc Netw Sensor Netw (GRAPH-HOC) 2

    Google Scholar 

  12. Horri A, Sepahvand R, Dastghaibyfard Gh (2008) A hierarchical scheduling and replication strategy. Int J Comput Sci Netw Secur, vol 8

    Google Scholar 

  13. Stockinger H, Samar A, Allcock B, Foster I, Holtman K, Tierney B (2002) File and object replication in data grids. J Clust Comput 5:305–314

    Article  Google Scholar 

  14. Tang M, Lee BS, Yao CK, Tang XY (2005) Dynamic replication algorithm for the multi tier data grid. Futur Gener Comput Syst, Elsevier 21: 775–790

    Google Scholar 

  15. Foster I, Ranganathan K (2002) Identifying dynamic replication strategies for high performance data grids.In: Proceedings of 3rd IEEE/ACM international workshop on grid computing, Lecture notes on computer science, vol 2242, pp 75–86

    Google Scholar 

  16. Bsoul M, Al-Khasawneh A, Kilani Y, Obeidat I (2010) A threshold-based dynamic data replication strategy. J Supercomput

    Google Scholar 

  17. Zhao W, Xu X, Wang Z, Zhang Y, He S (2010) A dynamic optimal replication strategy in data grid environment.In: International conference on internet technology and applications

    Google Scholar 

  18. Khanli LM, Isazadeh A, Shishavan TN (2010) PHFS: a dynamic replication method, to decrease access latency in the multi-tier data grid. Futur Gener Comput Syst, Elsevier, vol 27, pp 233–244

    Google Scholar 

  19. Park S, Kim J, Ko Y, Yoon W (2004) Dynamic data replication strategy based on internet hierarchy BHR. Lecture notes in computer science, Springer, Heidelberg, vol 3033, pp 838–846

    Google Scholar 

  20. Chang R, Chen P (2007) Complete and fragmented replica selection and retrieval in Data Grids. Futur Gener Comput Syst, Elsevier, vol 23, pp 536–546

    Google Scholar 

  21. Pérez JM, Carballeira F, Carretero J, Calderón A, Fernández J (2009) Branch replication scheme: a new model for data replication in large scale data grids. Futur Gener Comput Syst, Elsevier, vol 26, pp 12–20

    Google Scholar 

  22. Carballeira F, Carretero J, Calderon A, Garcia JD, Sanchez LM (2007) A global and parallel file systems for grids. Futur Gener Comput Syst 23:116–122

    Article  Google Scholar 

  23. Venugopal S, Buyya R (2008) An scp-based heuristic approach for scheduling distributed data-intensive applications on global grids. J Parallel Distributed Comput 68:471–487

    Article  MATH  Google Scholar 

  24. Chakrabarti A, Sengupta S (2008) Scalable and distributed mechanisms for integrated scheduling and replication in data grids. Proceedings of 10th International Conference on Distributed Computing and Networking (ICDCN)

    Google Scholar 

  25. Chervenak A, Deelman E, Livny M, Su M, Schuler R, Bharathi S, Mehta G, Vahi K (2007) Data placement for scientific applications in distributed environments. Proceedings of IEEE/ACM international conference on grid computing

    Google Scholar 

  26. Dang NN, Lim SB (2007) Combination of replication and scheduling in data grids. Int J Comput Sci Netw Secur 7:304–308

    Google Scholar 

  27. OptorSim, http://edg-wp2.web.cern.ch/

  28. Cameron D, Carvajal-Schiaffino R, Millar P, Nicholson C, Stockinger K, Zini F (2003) Evaluating scheduling and replica optimization strategies in OptorSim. Forth international workshop on grid computing, Phoenix, USA

    Google Scholar 

  29. Bell W, Cameron D, Carvajal-Schiaffino R, Millar P, Nicholson C, Stockinger K, Zini F (2004) OptorSim v1.0 installation and user guide

    Google Scholar 

Download references

Acknowledgments

The authors would like to thank Iran Telecommunication Research Center (www.itrc.ac.ir) for their financial support.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, College of Engineering, Shiraz University, Shiraz, Iran

    N. Mansouri & Gh. Dastghaibyfard

Authors
  1. N. Mansouri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gh. Dastghaibyfard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. Mansouri .

Editor information

Editors and Affiliations

  1. SeoulTech, Computer Science and Engineering, Seoul University of Science & Technology, Gongreung 2-dong 172, Seoul, 139-742, Korea, Republic of (South Korea)

    James J. (Jong Hyuk) Park

  2. Inst. Computer Science & Information, Engineering, National Ilan University, 1 Sec. 1, Shen-Lung Rd., I-Lan, 260, Taiwan R.O.C.

    Han-Chieh Chao

  3. , Computer Science & Software Engineering, Monmouth University, W. Long Branch, 07764, USA

    Mohammad S. Obaidat

  4. , Division of e-Business, Kyungnam University, Changwon, Korea, Republic of (South Korea)

    Jongsung Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media B.V.

About this paper

Cite this paper

Mansouri, N., Dastghaibyfard, G. (2012). A Novel Dynamic Replication Algorithm in Hierarchical Data Grid. In: J. (Jong Hyuk) Park, J., Chao, HC., S. Obaidat, M., Kim, J. (eds) Computer Science and Convergence. Lecture Notes in Electrical Engineering, vol 114. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-2792-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-2792-2_27

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-2791-5

  • Online ISBN: 978-94-007-2792-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation