Skip to main content
SpringerLink
Log in

Tree-Based Replica Location Scheme (TRLS) for Data Grids

  • Conference paper
Grid and Cooperative Computing - GCC 2004 (GCC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3251))

Included in the following conference series:

Abstract

Data grids provide researching groups with data management services such as Grid-Ftp, Reliable File Transfer Service (RFP), and Replica Location Service (RLS). Especially, Replica Location Service could improve data availability by storing multiple data to the distributed location. In this paper, we propose Tree-based Replica Location Scheme (TRLS) that could support users to decide optimally the location of multiple replicas as well as the number of replicas. In addition to, we could decide the number of replicas to satisfy user’s requirements by minimizing cost

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • 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.

References

  1. Wolfson, Milo, A.: The Multicast Policy and Its Relationship to Replicated Data Placement. ACM Transactions on Database Systems 16(1), 181–205 (1991)

    Article  MathSciNet  Google Scholar 

  2. Fisher, M.L., Hochbaum, D.S.: Database Location in Computer Networks. Journal of ACM 27(4), 718–735 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dowdy, L.W., Foster, D.V.: Comparative Models of the File Assignment Problem. ACM Computing Surveys 14(2), 287–313 (1982)

    Article  Google Scholar 

  4. Kalpakis, K., et al.: Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs. IEEE Transactions on Parallel and Distributed Systems (2001)

    Google Scholar 

  5. Cook, S.A., et al.: The Optimal Location of Replicas in a Network using a READONE-WRITE-ALL Policy. Journal of Distributed Computing 15 (2002)

    Google Scholar 

  6. Chu, W.W.: Optimal File Allocation in a Computer Network. In: Computer-Communication Systems, pp. 82–94. Prentice-Hall, Englewood Cliffs (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Information Assurance, National Security Research Institute, 52-1 Hwaam-dong, Yuseong-gu, Daejeon, 305-348, Korea

    Dong Su Nam & Eung Ki Park

  2. Protocol Engineering Center, ETRI, 161 Gajeong-dong, Yuseong-gu, Daejeon, 305-350, Korea

    Sangjin Jeong

  3. School of Engineering, Information and Communications University, 119 Munji-dong, Yuseong-gu, Daejeon, 305-714, Korea

    Dong Su Nam, Byungsang Kim & Chan-Hyun Youn

Authors
  1. Dong Su Nam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eung Ki Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sangjin Jeong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Byungsang Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chan-Hyun Youn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology, Huazhong University of Science and Technology, 430074, Wuhan, China

    Hai Jin

  2. Dept. of CS, Georgia State University, 30302, Atlanta, GA, USA

    Yi Pan

  3. National Laboratory for Parallel and Distributed Processing, NUDT, Changsha, 410073, Hunan, China

    Nong Xiao

  4. Cluster and Grid Computing Lab, Huazhong University of Science and Technology, 430074, Wuhan, China

    Jianhua Sun

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nam, D.S., Park, E.K., Jeong, S., Kim, B., Youn, CH. (2004). Tree-Based Replica Location Scheme (TRLS) for Data Grids. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_113

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30208-7_113

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23564-4

  • Online ISBN: 978-3-540-30208-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation