Skip to main content
SpringerLink
Log in

Robust CHARM: an efficient data hosting scheme for cloud data storage system

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

Cloud computing is the recent evolving arena, which offers more benefits to cloud service providers and online users, compared to the traditional architecture. In this paper, an efficient data-hosting scheme with high availability for implementing over heterogeneous multi-cloud system is proposed. The proposed ROBUST CHARM (RCH) scheme is designed with data hosting, storage mode switching, speed mode and workload indicator modules. These modules process data with the support of heuristic and storage mode transition algorithm. The algorithm is proved efficient in identifying the apt cloud to store data. Storage transition is adopted by considering the cost and data access pattern of the data stored during any requirements. This evaluation enables efficient usage of cloud resources with high availability. The experimental results show that the proposed scheme works effectively without affecting the performance compared to the existing systems. The ability to utilize heterogeneous multi-cloud storage with the benefit of cost effectiveness is an added advantage to the cloud users.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Li, Z., Jin, C., Xu, T., Wilson, C., Liu, Y., Cheng, L., Liu, Y., Dai, Y., and Zhang, Z.-L., Towards network-level efficiency for cloud storage services, Proceedings of the 2014 Conference on Internet Measurement Conference (IMC’14), Vancouver, BC, 2014, pp. 115–128.

    Google Scholar 

  2. Li, A., Yang, X., Kandula, S., and Zhang, M., CloudCmp: Comparing public cloud providers, Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement (IMC'10), Melbourne, 2010, pp. 1–14.

    Google Scholar 

  3. Bessani, A., Correia, M., Quaresma, B., Andre, F., and Sousa, P., DepSky: Dependable and secure storage in a cloud-of-clouds, Trans. Storage, 2013, vol. 9, no. 4, pp. 1–33.

    Article  Google Scholar 

  4. Abu-Libdeh, H., Princehouse, L., and Weatherspoon, H., RACS: A case for cloud storage diversity, Proceedings of the 1st ACM Symposium on Cloud Computing (SoCC '10), Indianapolis, Indiana, 2010, pp. 229–240.

    Chapter  Google Scholar 

  5. Liu, S., Huang, X., Fu, H., and Yang, G., Understanding data characteristics and access patterns in a cloud storage system, Proceedings of the 13th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), Delft, 2013, pp. 327–334.

    Google Scholar 

  6. Papaioannou, T.G., Bonvin, N., and Aberer, K., Scalia: An adaptive scheme for efficient multi-cloud storage, Proceedings of the 2012 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), Salt Lake City, 2012, pp. 1–10.

    Google Scholar 

  7. Plank, J.S., Greenan, K.M., and Miller, E.L., Screaming Fast Galois Field Arithmetic using Intel SIMD Instructions, Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST'13), San Jose, CA, 2013, pp. 299–306.

    Google Scholar 

  8. Weatherspoon, H. and Kubiatowicz, J.D., Erasure coding vs. replication: A quantitative comparison, Lect. Notes Comput. Sci., 2002, vol. 2429, pp. 328–337.

    Article  MATH  Google Scholar 

  9. Rodrigues, R. and Liskov, B., High Availability in DHTs: Erasure coding vs. replication, Lect. Notes Comput. Sci., 2005, vol. 3640, pp. 226–239.

    Article  Google Scholar 

  10. Yu, J., Lu, P., Zhu, Y., Xue, G., and Li, M., Toward secure multikeyword Top-k retrieval over encrypted cloud data, IEEE Trans. Depend. Secure Comput., 2013, vol. 10, no. 4, pp. 239–250.

    Article  Google Scholar 

  11. Shah, M.A., Baker, M., Mogul, J.C., Swaminathan, R., et al., Auditing to keep online storage services honest, Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems HOTOS’07, San Diego, CA, 2007, pp. 1–6.

    Google Scholar 

  12. Zhai, E., Chen, R., Wolinsky, D.I., and Ford, B., Heading off correlated failures through independence-as-aservice, Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation, Broomfield, CO, 2014, pp. 317–334.

    Google Scholar 

  13. Huang, C., et al., Erasure coding in Windows Azure Storage, Proceedings of the 2012 USENIX Annual Technical Conference, Boston, MA, 2012, pp. 15–26.

    Google Scholar 

  14. Zhao, Y., Jiang, H., Zhou, K., Huang, Z., and Huang, P., Meeting service level agreement cost-effectively for video-on-demand applications in the cloud, IEEE INFOCOM 2014, IEEE Conference on Computer Communications, Toronto, 2014, pp. 298–306.

    Chapter  Google Scholar 

  15. Cao, N., Wang, C., Li., M., Ren, K., and Lou, W., Privacy-preserving multi-keyword ranked search over encrypted cloud data, IEEE Transactions on Parallel and Distributed Systems, 2014, vol. 25, no. 1, pp. 222–233.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Communication Engineering, Hindustan Institute of Technology and Science, Hindustan University, Chennai, India

    M. Thangapandiyan & P. M. Rubesh Anand

Authors
  1. M. Thangapandiyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. M. Rubesh Anand
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. M. Rubesh Anand.

Additional information

The article is published in the original.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Thangapandiyan, M., Rubesh Anand, P.M. Robust CHARM: an efficient data hosting scheme for cloud data storage system. Aut. Control Comp. Sci. 51, 240–247 (2017). https://doi.org/10.3103/S0146411617040101

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411617040101

Keywords

Search

Navigation