QoS-aware, access-efficient, and storage-efficient replica placement in grid environments

Authors:
Chieh-Wen Cheng;Jan-Jan Wu;Pangfeng Liu
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan 115;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan and Graduated Institute of Networking and Multimedia, National Taiwan University, Taipei, Tai ...
Venue:
The Journal of Supercomputing
Year:
2009

Citing 15
Cited 3

The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
Routing of multipoint connections

Broadband switching
Optimal allocation of electronic content in networks

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Approximation algorithms for data management in networks

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs

IEEE Transactions on Parallel and Distributed Systems
Simulation of Dynamic Grid Replication Strategies in OptorSim

GRID '02 Proceedings of the Third International Workshop on Grid Computing
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
File and Object Replication in Data Grids

HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Placement of Read-Write Web Proxies in the Internet

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Data Replication Strategies in Grid Environments

ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
Optimal Content Location in Multicast Based Overlay Networks with Content Updates

World Wide Web
On the Optimal Placement of Secure Data Objects over Internet

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
QoS-Aware Replica Placement for Content Distribution

IEEE Transactions on Parallel and Distributed Systems
An efficient replicated data access approach for large-scale distributed systems

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Wide Area Data Replication for Scientific Collaborations

GRID '05 Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing

CAD: an efficient data management and migration scheme across clouds for data-intensive scientific applications

Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
A toolkit for storage qos provisioning for data-intensive applications

Building a National Distributed e-Infrastructure - PL-Grid
Allocating replicas in large-scale data grids using a QoS-aware distributed technique with workload constraints

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the quality-of-service (QoS)-aware replica placement problem in grid environments. Although there has been much work on the replica placement problem in parallel and distributed systems, most of them concern average system performance and have not addressed the important issue of quality of service requirement. In the very few existing work that takes QoS into consideration, a simplified replication model is assumed; therefore, their solution may not be applicable to real systems. In this paper, we propose a more realistic model for replica placement, which consider storage cost, update cost, and access cost of data replication, and also assumes that the capacity of each replica server is bounded.The QoS-aware replica placement is NP-complete even in the simple model. We propose two heuristic algorithms, called greedy remove and greedy add to approximate the optimal solution. Our extensive experiment results demonstrate that both greedy remove and greedy add find a near-optimal solution effectively and efficiently. Our algorithms can also adapt to various parallel and distributed environments.