Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Latency-Driven Replica Placement
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
The Livny and Plank-Beck Problems: Studies in Data Movement on the Computational Grid
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
A Latency-Based Object Placement Approach in Content Distribution Networks
LA-WEB '05 Proceedings of the Third Latin American Web Congress
Autonomic Data Placement Strategies for Update-intensiveWeb applications
AAA-IDEA '05 Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
An on-line replication strategy to increase availability in Data Grids
Future Generation Computer Systems
Comparison and analysis of ten static heuristics-based Internet data replication techniques
Journal of Parallel and Distributed Computing
PNUTS: Yahoo!'s hosted data serving platform
Proceedings of the VLDB Endowment
Flexible, wide-area storage for distributed systems with WheelFS
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines
The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines
Cassandra: a decentralized structured storage system
ACM SIGOPS Operating Systems Review
Quality of availability: replica placement for widely distributed systems
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Volley: automated data placement for geo-distributed cloud services
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
| Hi-index | 0.00 |
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.