research-article

Wide area placement of data replicas for fast and highly available data access

Authors:

Jeong-Hyon Hwang,

Chris McConnell,

Rohini VabbalareddyAuthors Info & Claims

DIDC '11: Proceedings of the fourth international workshop on Data-intensive distributed computing

Pages 1 - 8

https://doi.org/10.1145/1996014.1996016

Published: 08 June 2011 Publication History

Abstract

Recent years have seen rapid growth of online data storage and computing services at various locations around the world. In wide area applications, data can be replicated at multiple locations to serve users with lower latency and higher availability. This paper presents an approach that achieves both fast and highly available data access through periodic migration of data replicas. Such migration strives to maximize a user-defined objective function that incorporates data access delay and availability into a single utility value. To efficiently estimate data access delay and availability for any feasible replica placement, this approach maintains a small data structure that summarizes recent accesses to data replicas. This paper demonstrates, based on an evaluation study, the effectiveness of the developed technique and concludes with plans for future research.

References

[1]

http://www.planet-lab.org/.

[2]

S. Agarwal, J. Dunagan, N. Jain, S. Saroiu, A. Wolman, and H. Bhogan. Volley: automated data placement for geo-distributed cloud services. In Proceedings of the 7th USENIX conference on Networked systems design and implementation, pages 2--2. USENIX Association, 2010.

Digital Library

[3]

M. Allen and R. Wolski. The Livny and Plank-Beck Problems: Studies in data movement on the computational grid. In Proceedings of the 2003 ACM/IEEE conference on Supercomputing, page 43. IEEE Computer Society, 2003.

Digital Library

[4]

L. Barroso and U. Holzle. The datacenter as a computer: An introduction to the design of warehouse-scale machines. Synthesis Lectures on Computer Architecture, 4(1):1--108, 2009.

[5]

CNET News. Google spotlights data center inner workings. http://news.cnet.com/8301-10784_3-9955184-7.html.

[6]

B. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H. Jacobsen, N. Puz, D. Weaver, and R. Yerneni. PNUTS: Yahoo!'s hosted data serving platform. Proceedings of the VLDB Endowment, 1(2):1277--1288, 2008.

Digital Library

[7]

F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In SIGCOMM, pages 15--26, 2004.

Digital Library

[8]

Data Center Map. Data Center Statistics. http://www.datacentermap.com/datacenters.html.

[9]

J. Douceur and R. Wattenhofer. Competitive hill-climbing strategies for replica placement in a distributed file system. Distributed Computing, pages 48--62, 2001.

Digital Library

[10]

D. Hastorun, M. Jampani, G. Kakulapati, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazons highly available key-value store. In Proceedings of 21th ACM SIGOPS symposium on Operating systems principles. Citeseer, 2007.

Digital Library

[11]

M. Karlsson and C. Karamanolis. Choosing replica placement heuristics for wide-area systems. In Distributed Computing Systems, 2004. Proceedings. 24th International Conference on, pages 350--359. IEEE, 2005.

Digital Library

[12]

S. Khan and I. Ahmad. Comparison and analysis of ten static heuristics-based Internet data replication techniques. Journal of Parallel and Distributed Computing, 68(2):113--136, 2008.

Digital Library

[13]

A. Lakshman and P. Malik. Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review, 44(2):35--40, 2010.

Digital Library

[14]

M. Lei, S. Vrbsky, and X. Hong. An on-line replication strategy to increase availability in data grids. Future Generation Computer Systems, 24(2):85--98, 2008.

Digital Library

[15]

T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In INFOCOM, pages 170--179, 2002.

[16]

G. On, J. Schmitt, and R. Steinmetz. Quality of availability: Replica placement for widely distributed systems. In IWQoS, pages 325--344, 2003.

Digital Library

[17]

G. Pallis, A. Vakali, K. Stamos, A. Sidiropoulos, D. Katsaros, and Y. Manolopoulos. A latency-based object placement approach in content distribution networks. In Web Congress, 2005. LA-WEB 2005. Third Latin American, page 8. IEEE, 2006.

Digital Library

[18]

F. Ping, C. McConnell, and J.-H. Hwang. A retrospective approach for accurate network latency prediction. In Proceedings of the 2nd Workshop on Grid and P2P Systems and Applications (GridPeer), 2010.

[19]

J. Plank, S. Atchley, Y. Ding, and M. Beck. Algorithms for high performance, wide-area distributed file downloads. Parallel Processing Letters, 13(2):207--224, 2003.

[20]

L. Qiu, V. Padmanabhan, and G. Voelker. On the placement of web server replicas. In INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, volume 3, pages 1587--1596. IEEE, 2002.

[21]

F. Schintke and A. Reinefeld. Modeling replica availability in large data grids. Journal of Grid Computing, 1(2):219--227, 2003.

[22]

S. Sivasubramanian, G. Pierre, and M. van Steen. Autonomic Data Placement Strategies for Update-intensiveWeb applications. In Advanced Architectures and Algorithms for Internet Delivery and Applications, 2005. AAA-IDEA 2005. First International Workshop on, pages 2--9. IEEE, 2006.

Digital Library

[23]

J. Stribling, Y. Sovran, I. Zhang, X. Pretzer, J. Li, M. F. Kaashoek, and R. Morris. Flexible, wide-area storage for distributed systems with wheelfs. In Proceedings of the 4th Symposium on Networked Systems Design and Implementation (NSDI), pages 43--58, 2009.

Digital Library

[24]

M. Szymaniak. Latency-driven replication for globally distributed systems. Thesis, 2007.

[25]

M. Szymaniak, G. Pierre, and M. Steen. Latency-Driven Replica Placement. In Proceedings of the The 2005 Symposium on Applications and the Internet, pages 399--405. IEEE Computer Society, 2005.

Digital Library

[26]

TeraGrid. https://www.teragrid.org/.

Cited By

VanBenschoten NAjmani AGartner MMatei AShah ASharif IShraer AStorm ATaft RTan OWoods AWalters PIves ZBonifati AEl Abbadi A(2022)Enabling the Next Generation of Multi-Region Applications with CockroachDBProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526053(2312-2325)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526053
Taft RSharif IMatei AVanBenschoten NLewis JGrieger TNiemi KWoods ABirzin APoss RBardea PRanade ADarnell BGruneir BJaffray JZhang LMattis PMaier DPottinger RDoan ATan WAlawini ANgo H(2020)CockroachDB: The Resilient Geo-Distributed SQL DatabaseProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3386134(1493-1509)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3386134
Chang WWang P(2019)Write-Aware Replica Placement for Cloud ComputingIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.289455537:3(656-667)Online publication date: Mar-2019
https://doi.org/10.1109/JSAC.2019.2894555
Show More Cited By

Index Terms

Wide area placement of data replicas for fast and highly available data access
1. Information systems
  1. Information retrieval
    1. Search engine architectures and scalability
      1. Distributed retrieval
      2. Peer-to-peer retrieval
  2. Information storage systems
    1. Storage architectures
      1. Distributed storage

Recommendations

Replica Placement Strategy for Data Grid Environment

Data Grid is an infrastructure that manages huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. To increase resource availability and to ease resource sharing in such environment, ...
Quorum-based synchronization protocols for multimedia replicas

Multiple replicas of multimedia objects are distributed to peers in overlay networks. In quorum-based (QB) protocols, every replica may not be up-to-date and the up-to-date replica can be found in the version counter. Multimedia objects are ...
Access Control in Wide-Area Networks
ICDCS '97: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)

Access control involves maintaining information about which users can access system resources and ensuring that access is restricted to authorized users. In wide-area networks such as the Internet, implementing access control is difficult, since ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DIDC '11: Proceedings of the fourth international workshop on Data-intensive distributed computing

June 2011

60 pages

ISBN:9781450307048

DOI:10.1145/1996014

General Chair:
Tevfik Kosar
University at Buffalo, USA

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

University of Arizona: University of Arizona
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

HPDC '11

Sponsor:

University of Arizona
SIGARCH

HPDC '11: The 20th International Symposium on High-Performance Parallel and Distributed Computing

June 8, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 7 of 12 submissions, 58%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
264
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

VanBenschoten NAjmani AGartner MMatei AShah ASharif IShraer AStorm ATaft RTan OWoods AWalters PIves ZBonifati AEl Abbadi A(2022)Enabling the Next Generation of Multi-Region Applications with CockroachDBProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526053(2312-2325)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526053
Taft RSharif IMatei AVanBenschoten NLewis JGrieger TNiemi KWoods ABirzin APoss RBardea PRanade ADarnell BGruneir BJaffray JZhang LMattis PMaier DPottinger RDoan ATan WAlawini ANgo H(2020)CockroachDB: The Resilient Geo-Distributed SQL DatabaseProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3386134(1493-1509)Online publication date: 11-Jun-2020
https://dl.acm.org/doi/10.1145/3318464.3386134
Chang WWang P(2019)Write-Aware Replica Placement for Cloud ComputingIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.289455537:3(656-667)Online publication date: Mar-2019
https://doi.org/10.1109/JSAC.2019.2894555
Chang WWang P(2017)A write-operation-adaptable replication system for multiplayer cloud gaming2017 IEEE Conference on Dependable and Secure Computing10.1109/DESEC.2017.8073820(334-339)Online publication date: Aug-2017
https://doi.org/10.1109/DESEC.2017.8073820
Zakhary VNawab FAgrawal DEl Abbadi AÖzcan FKoutrika GMadden S(2016)DB-RiskProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2899405(2185-2188)Online publication date: 26-Jun-2016
https://dl.acm.org/doi/10.1145/2882903.2899405

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten