DocumentCode :
46538
Title :
QoS-Aware Data Replication for Data-Intensive Applications in Cloud Computing Systems
Author :
Jenn-Wei Lin ; Chien-Hung Chen ; Chang, J.M.
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Fu Jen Catholic Univ., New Taipei, Taiwan
Volume :
1
Issue :
1
fYear :
2013
fDate :
Jan.-June 2013
Firstpage :
101
Lastpage :
115
Abstract :
Cloud computing provides scalable computing and storage resources. More and more data-intensive applications are developed in this computing environment. Different applications have different quality-of-service (QoS) requirements. To continuously support the QoS requirement of an application after data corruption, we propose two QoS-aware data replication (QADR) algorithms in cloud computing systems. The first algorithm adopts the intuitive idea of high-QoS first-replication (HQFR) to perform data replication. However, this greedy algorithm cannot minimize the data replication cost and the number of QoS-violated data replicas. To achieve these two minimum objectives, the second algorithm transforms the QADR problem into the well-known minimum-cost maximum-flow (MCMF) problem. By applying the existing MCMF algorithm to solve the QADR problem, the second algorithm can produce the optimal solution to the QADR problem in polynomial time, but it takes more computational time than the first algorithm. Moreover, it is known that a cloud computing system usually has a large number of nodes. We also propose node combination techniques to reduce the possibly large data replication time. Finally, simulation experiments are performed to demonstrate the effectiveness of the proposed algorithms in the data replication and recovery.
Keywords :
cloud computing; computational complexity; quality of service; replicated databases; storage management; HQFR; MCMF algorithm; MCMF problem; QADR algorithms; QADR problem; QoS requirements; QoS-aware data replication algorithms; QoS-violated data replicas; cloud computing systems; computational time; computing environment; computing resource; data corruption; data recovery; data replication cost; data-intensive applications; greedy algorithm; high-QoS first-replication; minimum-cost maximum-flow problem; node combination techniques; polynomial time; quality-of-service requirements; storage resource; Algorithm design and analysis; Cloud computing; Heuristic algorithms; Quality of service; Radio frequency; Servers; Switches; Cloud computing; data replication; data-intensive application; network flow problem; quality of service;
fLanguage :
English
Journal_Title :
Cloud Computing, IEEE Transactions on
Publisher :
ieee
ISSN :
2168-7161
Type :
jour
DOI :
10.1109/TCC.2013.1
Filename :
6562695
Link To Document :
بازگشت