Call for Paper - August 2022 Edition
IJCA solicits original research papers for the August 2022 Edition. Last date of manuscript submission is July 20, 2022. Read More

Reliable and Secure Data Availability in Distributed Cloud Data Storage using Optimal Exact – Regenerating Codes

Print
PDF
IJCA Proceedings on National Conference on Advances in Computing Applications
© 2016 by IJCA Journal
NCACA 2016 - Number 1
Year of Publication: 2016
Authors:
Malay Kumar
Aprnatripath
Manu Vardhan

Malay Kumar, Aprnatripath and Manu Vardhan. Article: Reliable and Secure Data Availability in Distributed Cloud Data Storage using Optimal Exact Regenerating Codes. IJCA Proceedings on National Conference on Advances in Computing Applications NCACA 2016(1):25-29, September 2016. Full text available. BibTeX

@article{key:article,
	author = {Malay Kumar and Aprnatripath and Manu Vardhan},
	title = {Article: Reliable and Secure Data Availability in Distributed Cloud Data Storage using Optimal Exact  Regenerating Codes},
	journal = {IJCA Proceedings on National Conference on Advances in Computing Applications},
	year = {2016},
	volume = {NCACA 2016},
	number = {1},
	pages = {25-29},
	month = {September},
	note = {Full text available}
}

Abstract

One of many advantages of cloud computing is to provide reliable data storage facility. The cloud computing provides seamless access to storage facility to the client to upload, download and modifies unlimited amount data. However, at the same time, outsourcing data to the third party cloud storage system is a great cause of concern to the client. The client loses physical control of the data which compromises the security, reliability, and confidentiality of data. This paper proposes a new framework for reliable and secure data storage which ensure data security, reliability and availability using Optimal Exact – Regenerating Codes [1]. This framework is different from existing approach of data redundancy for ensuring data availability and reliability. To, ensure the data availability our method relies on multiple cloud service providers (CSP). Each CSP is view as individual disks of RAID where some parts of client data are stored. Since none of the CSP have complete access to client data so, the individual CSP cannot breach the client data. The proposed framework is compared with traditional erasure coding such as Reed- Solomon Codes (RSC). RSC causes much higher repair cost for failed disk and even higher access latency.

References

  • K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5227–5239, 2011.
  • R. Ranchal, B. Bhargava, L. Ben Othmane, L. Lilien, A. Kim, M. Kang, and M. Linderman, "Protection of identity information in cloud computing without trusted third party," Proc. IEEE Symp. Reliab. Distrib. Syst. , pp. 368–372, 2010.
  • A. Skendzic and B. Kovacic, "Microsoft Office 365 - cloud in business environment," MIPRO, 2012 Proc. 35th Int. Conv. , pp. 1434–1439, 2012.
  • S. Marston, S. Bandyopadhyay, and a Ghalsasi, "Cloud Computing - The Business Perspective," 2011 44th Hawaii Int. Conf. Syst. Sci. , pp. 1–11, 2011.
  • S. Weil and A. Leung, "Rados: a scalable, reliable storage service for petabyte-scale storage clusters," PDSW '07 Proc. 2nd Int. Work. Petascale data storage held conjunction with Supercomput. '07, pp. 35–44, 2007.
  • C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure Coding in Windows Azure Storage," Atc, p. 12, 2012.
  • S. Jiekak, A. M. Kermarrec, N. Le Scouarnec, G. Straub, and A. Van Kempen, "Regenerating codes: A system perspective," Proc. IEEE Symp. Reliab. Distrib. Syst. , pp. 436–441, 2012.
  • S. Distributed, C. Data, and S. Using, "Int ' l Journal of Software Engineering and Knowledge Engineering Reliable and Secure Distributed Cloud Data Storage Using Reed-Solomon Codes. "
  • J. Li and B. Li, "Erasure coding for cloud storage systems: A survey," Tsinghua Sci. Technol. , vol. 18, no. 3, pp. 259–272, 2013.
  • S. B. Wicker and V. K. Bhargava, "An Introduction to Reed-Solomon Codes," Reed-Solomon Codes Their Appl. , pp. 1–16, 1999.
  • A. G. Dimakis, P. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," Inf. Theory, IEEE Trans. , vol. 56, no. 9, pp. 4539–4551, 2010.
  • H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: A quantitative comparison," in International Workshop on Peer-to-Peer Systems, 2002, pp. 328–337.
  • R. Bhagwan, K. Tati, Y. Cheng, S. Savage, and G. M. Voelker, "Total Recall: System Support for Automated Availability Management. "
  • J. S. Plank, "Erasure codes for storage systems: A brief primer," Usenix Mag. , vol. 38, pp. 44–51, 2013.
  • H. Xu and D. Bhalerao, "A Reliable and Secure Cloud Storage Schema Using Multiple Service Providers," pp. 116–121.
  • A. G. Dimakis and K. Ramchandran, "A Survey on Network Codes for Distributed Storage," vol. 99, no. 3, pp. 1–13, 2011