Controversy corner: Optimized QoS-aware replica placement heuristics and applications in astronomy data grid

Authors:
Zhihui Du;Jingkun Hu;Yinong Chen;Zhili Cheng;Xiaoying Wang
Affiliations:
Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;School of Software and Microelectronics, Peking University, Beijing 100871, China;School of Computing, Informatics & Decision Systems Eng, Arizona State University, Tempe, AZ 85287, USA;Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China and Department of Computer Technology ...
Venue:
Journal of Systems and Software
Year:
2011

Citing 13
Cited 0

The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
The cache location problem

IEEE/ACM Transactions on Networking (TON)
Algorithm 97: Shortest path

Communications of the ACM
Data Management in an International Data Grid Project

GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
Dynamic Replica Placement for Scalable Content Delivery

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Data Replication Strategies in Grid Environments

ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
A Service Scheduler in a Trustworthy System

ANSS '04 Proceedings of the 37th annual symposium on Simulation
QoS-Aware Replica Placement for Content Distribution

IEEE Transactions on Parallel and Distributed Systems
A SOA Based Pipeline System to Deal with Astronomy Telescope Data

SOSE '06 Proceedings of the Second IEEE International Symposium on Service-Oriented System Engineering
A QoS-Aware Heuristic Algorithm for Replica Placement

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

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the Quality-of-Service (QoS)-aware replica placement problem in a general graph model. Since the problem was proved NP-hard, heuristic algorithms are the current solutions to the problem. However, these algorithms cannot always find the effective replica placement strategy. We propose two algorithms that can obtain better results within the given time period. The first algorithm is called Cover Distance algorithm, which is based on the Greedy Cover algorithm. The second algorithm is an optimized genetic algorithm, in which we use random heuristic algorithms to generate initial population to avoid enormous useless searching. Then, the 0-Greedy-Delete algorithm is used to optimize the genetic algorithm solutions. According to the performance evaluation, our Cover Distance algorithm can obtain relatively better solution in time critical scenarios. Whereas, the optimized genetic algorithm is better when the replica cost is of higher priority than algorithm execution time. The QoS-aware data replication heuristic algorithms are applied into the data distribution service of an astronomy data grid pipeline prototype, and the operation process is studied in detail.