A Low-Cost Multi-failure Resilient Replication Scheme for High Data Availability in Cloud Storage

Replication is a common approach to enhance data availability in cloud storage systems. Previously proposed replication schemes cannot effectively handle both correlated and non-correlated machine failures while increasing the data availability with the limited resource. The schemes for correlated machine failures must create a constant number of replicas for each data object, which neglects diverse data popularities and cannot utilize the resource to maximize the expected data availability. Also, the previous schemes neglect the consistency maintenance cost and the storage cost caused by replication. It is critical for cloud providers to maximize data availability (hence minimize SLA violations) while minimizing cost caused by replication in order to maximize the revenue. In this paper, we build a nonlinear integer programming model to maximize data availability in both types of failures and minimize the cost caused by replication. Based on the model's solution for the replication degree of each data object, we propose a low-cost multi-failure resilient replication scheme (MRR). MRR can effectively handle both correlated and non-correlated machine failures, considers data popularities to enhance data availability, and also tries to minimize consistency maintenance cost and storage cost. Extensive numerical results from trace parameters and experiments from real-world Amazon S3 show that MRR achieves high data availability, low data loss probability and low consistency maintenance cost and storage cost compared to previous replication schemes.

[1]  Jeffrey Dean,et al.  Evolution and future directions of large-scale storage and computation systems at Google , 2010, SoCC '10.

[2]  Van-Anh Truong,et al.  Availability in Globally Distributed Storage Systems , 2010, OSDI.

[3]  Sachin Katti,et al.  Copysets: Reducing the Frequency of Data Loss in Cloud Storage , 2013, USENIX Annual Technical Conference.

[4]  Lei Yu,et al.  Characterizing data deliverability of greedy routing in wireless sensor networks , 2015, SECON.

[5]  P. Östergård,et al.  There exists no (15,5,4) RBIBD † * , 2001 .

[6]  Robert J. Chansler,et al.  Data Availability and Durability with the Hadoop Distributed File System , 2012, login Usenix Mag..

[7]  S. Houghten,et al.  There is no (46, 6, 1) block design* , 2001 .

[8]  Haiying Shen,et al.  Dependency-Aware and Resource-Efficient Scheduling for Heterogeneous Jobs in Clouds , 2016, 2016 IEEE International Conference on Cloud Computing Technology and Science (CloudCom).

[9]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[10]  Suman Banerjee,et al.  An ensemble of replication and erasure codes for cloud file systems , 2013, 2013 Proceedings IEEE INFOCOM.

[11]  Irene Zhang Reducing the Frequency of Data Loss in Cloud Storage , 2013 .

[12]  Daniel J. Abadi,et al.  CalvinFS: Consistent WAN Replication and Scalable Metadata Management for Distributed File Systems , 2015, FAST.

[13]  Hairong Kuang,et al.  The Hadoop Distributed File System , 2010, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST).

[14]  Andreas Haeberlen,et al.  Glacier: highly durable, decentralized storage despite massive correlated failures , 2005, NSDI.

[15]  Jin Li,et al.  SocialTube: P2P-Assisted Video Sharing in Online Social Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[16]  Jennifer Rexford,et al.  NoHype: virtualized cloud infrastructure without the virtualization , 2010, ISCA.

[17]  Indranil Gupta,et al.  Making cloud intermediate data fault-tolerant , 2010, SoCC '10.

[18]  Ming Zhong,et al.  Replication degree customization for high availability , 2008, Eurosys '08.

[19]  Amin Vahdat,et al.  The costs and limits of availability for replicated services , 2001, TOCS.

[20]  Haiying Shen,et al.  A Survey of Mobile Crowdsensing Techniques: A Critical Component for the Internet of Things , 2016, ICCCN.

[21]  Haiying Shen,et al.  CORP: Cooperative Opportunistic Resource Provisioning for Short-Lived Jobs in Cloud Systems , 2016, 2016 IEEE International Conference on Cluster Computing (CLUSTER).

[22]  Albert G. Greenberg,et al.  Scarlett: coping with skewed content popularity in mapreduce clusters , 2011, EuroSys '11.

[23]  Jianwei Liu,et al.  SCPS: A Social-Aware Distributed Cyber-Physical Human-Centric Search Engine , 2015, IEEE Transactions on Computers.

[24]  Nithin Nakka,et al.  Detailed analysis of I/O traces for large scale applications , 2009, 2009 International Conference on High Performance Computing (HiPC).

[25]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[26]  Ben Y. Zhao,et al.  Exploiting locality of interest in online social networks , 2010, CoNEXT.

[27]  Anne-Marie Kermarrec,et al.  Archiving cold data in warehouses with clustered network coding , 2014, EuroSys '14.

[28]  Alexander L. Wolf,et al.  Partition selection policies in object database garbage collection , 1994, SIGMOD '94.

[29]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[30]  Srinivasan Seshan,et al.  Subtleties in Tolerating Correlated Failures in Wide-area Storage Systems , 2006, NSDI.

[31]  Ju Wang,et al.  Windows Azure Storage: a highly available cloud storage service with strong consistency , 2011, SOSP.

[32]  Karl Aberer,et al.  A self-organized, fault-tolerant and scalable replication scheme for cloud storage , 2010, SoCC '10.

[33]  Veena Rawat,et al.  Reducing Failure Probability of cloud storage services using Multi-Clouds , 2013, ArXiv.

[34]  Hongxin Hu,et al.  Load-aware and congestion-free state management in network function virtualization , 2017, 2017 International Conference on Computing, Networking and Communications (ICNC).

[35]  Mendel Rosenblum,et al.  Fast crash recovery in RAMCloud , 2011, SOSP.

[36]  D Ravi,et al.  Knowledge Sharing in the Online Social Network of Yahoo ! Answers and Its Implications , 2016 .

[37]  Komal Shringare,et al.  Apache Hadoop Goes Realtime at Facebook , 2015 .

[38]  Lei Yu,et al.  Question Quality Analysis and Prediction in Community Question Answering Services with Coupled Mutual Reinforcement , 2017, IEEE Transactions on Services Computing.

[39]  Patric R. J. Östergård,et al.  There exists no (15,5,4) RBIBD , 2001 .

[40]  Robbert van Renesse,et al.  Leveraging sharding in the design of scalable replication protocols , 2013, SoCC.

[41]  Sandhya Dwarkadas,et al.  Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval , 2004, NSDI.

[42]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[43]  Suman Nath,et al.  Availability of multi-object operations , 2006 .

[44]  Jian Yang,et al.  Mojim: A Reliable and Highly-Available Non-Volatile Memory System , 2015, ASPLOS.

[45]  Emin Gün Sirer,et al.  Tiered Replication: A Cost-effective Alternative to Full Cluster Geo-replication , 2015, USENIX Annual Technical Conference.

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