QoS-aware replica placement for grid computing

Authors:
Jan-Jan Wu;Shu-Fan Shih;Hsiangkai Wang;Pangfeng Liu;Chien-Min Wang
Affiliations:
Institute of Information Science, Academia Sinica, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Institute of Information Science, Academia Sinica, Taipei, Taiwan
Venue:
Concurrency and Computation: Practice & Experience
Year:
2011

Citing 17
Cited 0

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Routing of multipoint connections

Broadband switching
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
Data Management in an International Data Grid Project

GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Identifying Dynamic Replication Strategies for a High-Performance Data Grid

GRID '01 Proceedings of the Second 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
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
A QoS-Aware Heuristic Algorithm for Replica Placement

GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the QoS-aware replica placement problem. Although there has been much research on the problem, most approaches focus on the average system performance and ignore the quality assurance issue. However, quality assurance is crucial, especially in heterogeneous environments. To fill this research gap, we proposed four heuristic algorithms to determine the locations of replicas in order to satisfy the quality requirements imposed by data requests. Three of the algorithms are greedy heuristics called Greedy-Cover, Cover-Partition and Multi-Source. The fourth algorithm is based on the Simulated Annealing technique. Our experiment results indicated that Greedy-Cover and the Simulated Annealing-based algorithms can find effective solutions efficiently. Copyright © 2011 John Wiley & Sons, Ltd.