Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds

He, Jing, Zhang, Yanchun, Huang, Guangyan, Shi, Yong and Cao, Jie 2012, Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds, Journal of computer and system sciences, vol. 78, no. 5, pp. 1345-1358, doi: 10.1016/j.jcss.2011.12.018.

Attached Files
Name Description MIMEType Size Downloads

Title Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
Author(s) He, Jing
Zhang, Yanchun
Huang, GuangyanORCID iD for Huang, Guangyan orcid.org/0000-0002-1821-8644
Shi, Yong
Cao, Jie
Journal name Journal of computer and system sciences
Volume number 78
Issue number 5
Start page 1345
End page 1358
Total pages 14
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2012-09
ISSN 0022-0000
Summary Distributing multiple replicas in geographically-dispersed clouds is a popular approach to reduce latency to users. It is important to ensure that each replica should have availability and data integrity features; that is, the same as the original data without any corruption and tampering. Remote data possession checking is a valid method to verify the replicass availability and integrity. Since remotely checking the entire data is time-consuming due to both the large data volume and the limited bandwidth, efficient data-possession- verifying methods generally sample and check a small hash (or random blocks) of the data to greatly reduce the I/O cost. Most recent research on data possession checking considers only single replica. However, multiple replicas data possession checking is much more challenging, since it is difficult to optimize the remote communication cost among multiple geographically-dispersed clouds. In this paper, we provide a novel efficient Distributed Multiple Replicas Data Possession Checking (DMRDPC) scheme to tackle new challenges. Our goal is to improve efficiency by finding an optimal spanning tree to define the partial order of scheduling multiple replicas data possession checking. But since the bandwidths have geographical diversity on the different replica links and the bandwidths between two replicas are asymmetric, we must resolve the problem of Finding an Optimal Spanning Tree in a Complete Bidirectional Directed Graph, which we call the FOSTCBDG problem. Particularly, we provide theories for resolving the FOSTCBDG problem through counting all the available paths that viruses attack in clouds network environment. Also, we help the cloud users to achieve efficient multiple replicas data possession checking by an approximate algorithm for tackling the FOSTCBDG problem, and the effectiveness is demonstrated by an experimental study. © 2011 Elsevier Inc.
Language eng
DOI 10.1016/j.jcss.2011.12.018
Field of Research 0802 Computation Theory And Mathematics
0805 Distributed Computing
080109 Pattern Recognition and Data Mining
Socio Economic Objective 890205 Information Processing Services (incl. Data Entry and Capture)
HERDC Research category C1.1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2012, Elsevier
Persistent URL http://hdl.handle.net/10536/DRO/DU:30083653

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 11 times in TR Web of Science
Scopus Citation Count Cited 19 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 165 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Tue, 24 May 2016, 21:30:43 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.