Data Replication Placement Strategy Based On Bidding Mode for Cloud Storage Cluster

The data availability in large-scale cloud storage has been increasing by means of data replica. To provide cost-effective availability, minimize the response time of applications and make load balancing for cloud storage, a new replica placement policy with bidding thought is proposed. The policy combines the own characteristics of replica and factors of bidding mode(e.g. bidding time, bidding standard, bidding price etc.) and starts replica bidding activity when the file data availability cannot meet the given requirement. Replica placement is based on capacity and accessing probability of data nodes. The experimental results show that our policy has a better performance in both load balance and response time comparing to the static replica policy and CDRM scheme.

[1]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[2]  Panagiotis Kalagiakos,et al.  Cloud Computing learning , 2011, 2011 5th International Conference on Application of Information and Communication Technologies (AICT).

[3]  Le Xie,et al.  Risk Measure Based Robust Bidding Strategy for Arbitrage Using a Wind Farm and Energy Storage , 2013, IEEE Transactions on Smart Grid.

[4]  Kavitha Ranganathan,et al.  Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[5]  Kavitha Ranganathan,et al.  Identifying Dynamic Replication Strategies for a High-Performance Data Grid , 2001, GRID.

[6]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[7]  Karl Aberer,et al.  Dynamic cost-efficient replication in data clouds , 2009, ACDC '09.

[8]  Robert L. Grossman,et al.  The Case for Cloud Computing , 2009, IT Professional.

[9]  Rajmohan Rajaraman,et al.  Placement Algorithms for Hierarchical Cooperative Caching , 2001, J. Algorithms.

[10]  Byoung-Dai Lee,et al.  Dynamic Data Replication Scheme in the Cloud Computing Environment , 2012, 2012 Second Symposium on Network Cloud Computing and Applications.

[11]  Kang G. Shin,et al.  FS2: dynamic data replication in free disk space for improving disk performance and energy consumption , 2005, SOSP '05.

[12]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[13]  Jeffrey S. Chase,et al.  Proceedings of the 1st workshop on Automated control for datacenters and clouds , 2009, ICAC 2009.

[14]  D. Janaki Ram,et al.  Node-Capability-Aware Replica Management for Peer-to-Peer Grids , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[15]  Dimitris Papadias,et al.  An overview of data replication on the Internet , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[16]  GhemawatSanjay,et al.  The Google file system , 2003 .

[17]  Dan Feng,et al.  CDRM: A Cost-Effective Dynamic Replication Management Scheme for Cloud Storage Cluster , 2010, 2010 IEEE International Conference on Cluster Computing.