Dynamic Data Replication Strategy Based on Federation Data Grid Systems | SpringerLink
Skip to main content

Dynamic Data Replication Strategy Based on Federation Data Grid Systems

  • Conference paper
Information Computing and Applications (ICICA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6377))

Included in the following conference series:

Abstract

Data access latency is one of the important factors of system performance in federated data grid. However, different replication strategies resulted in different access latency. This paper proposes a model of replication strategy in federated data grid that is known as dynamic replication for federation (DRF). DRF uses the concept of a defined ‘network core area’ (NCA) as the designated search area of which a search will be focussed. However, the area known as NCA is not static and it is bound to change if data requested cannot be found. This paper will also highlight how NCA is defined and reallocated if a search fails. Results from the analysis show that the DRF proposed in this paper is superior to Optimal Downloading Replication Strategy (ODRS) in terms of wide area network bandwidth requirement and in the average access latency data where the results was 48% higher than for ρ j =0.3, 0.4, 0.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chang, R.-S., Wang, C.-M., Chen, P.-H.: Complete and fragmented replica selection and retrieval in Data Grids. Future Generation Computer System, 536–546 (2007)

    Google Scholar 

  2. Venugopal, S., Buyya, R., Ramamohanarao, K.: A taxonomy of data grids for distributed data sharing, management and processing. ACM Computing

    Google Scholar 

  3. Lamehamedi, H., Shentu, Z., Szymanski, B., et al.: Simulation of dynamic data replication in data grids. In: Proceeding of the International Parallel and Distributed Processing Symposium. IEEE Computer Society, Washington (2003)

    Google Scholar 

  4. Tang, M., Lee, B.-S., Yeo, C.-K., Tang, X.: Dynamic replication algorithms for the multi-tier data grid. Future Generation Computer System 21, 775–790 (2005)

    Article  Google Scholar 

  5. Jianjin, J., Guangwen, Y.: An Optimal Replication Strategy for data grid system. Front Computer. Sci. China 1(3), 338–348 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zarina, M., Deris, M.M., Rose, A.N.M.M., Isa, A.M. (2010). Dynamic Data Replication Strategy Based on Federation Data Grid Systems. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Lecture Notes in Computer Science, vol 6377. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16167-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16167-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16166-7

  • Online ISBN: 978-3-642-16167-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics