Improving Data Availability by Data Partitioning and Partial Overlapping on Multiple Cloud Storages 


Vol. 36,  No. 12, pp. 1498-1508, Dec.  2011


PDF
  Abstract

A cloud service customer has no other way but to wait for his lost data to be recovered by the cloud service provider when the data was lost or not accessible for a while due to the provider’s system failure, cracking attempt, malfunction, or outage. We consider a solution to address this problem that can be implemented in the cloud client’s domain, rather than in the cloud service provider’s domain. We propose a high level architecture and scheme for successfully retrieving data units even when several cloud storages are not accessible at the same time. The scheme is based on a clever way of partitioning and partial overlapping of data for being stored on multiple cloud storages. In addition to providing a high level of data availability, the scheme makes it possible to re-encrypt data units with new keys in a user transparent way, and can produce the complete log of every user’s data units accessed, for assessing data disclosure, if needed.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Park, "Improving Data Availability by Data Partitioning and Partial Overlapping on Multiple Cloud Storages," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 12, pp. 1498-1508, 2011. DOI: .

[ACM Style]

Jun-Cheol Park. 2011. Improving Data Availability by Data Partitioning and Partial Overlapping on Multiple Cloud Storages. The Journal of Korean Institute of Communications and Information Sciences, 36, 12, (2011), 1498-1508. DOI: .

[KICS Style]

Jun-Cheol Park, "Improving Data Availability by Data Partitioning and Partial Overlapping on Multiple Cloud Storages," The Journal of Korean Institute of Communications and Information Sciences, vol. 36, no. 12, pp. 1498-1508, 12. 2011.