An algorithm for distributed computation of a spanningtree in an extended LAN
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Queue - Storage
UbiCrawler: a scalable fully distributed web crawler
Software—Practice & Experience
High-Performance MPI Broadcast Algorithm for Grid Environments Utilizing Multi-lane NICs
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Planetary-scale views on a large instant-messaging network
Proceedings of the 17th international conference on World Wide Web
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Distributed Computing Economics
Queue - Object-Relational Mapping
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
MetaCDN: Harnessing 'Storage Clouds' for high performance content delivery
Journal of Network and Computer Applications
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Centrifuge: integrated lease management and partitioning for cloud services
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Volley: automated data placement for geo-distributed cloud services
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
A Multiple-Replica Remote Data Possession Checking Protocol with Public Verifiability
ISDPE '10 Proceedings of the 2010 Second International Symposium on Data, Privacy, and E-Commerce
Hi-index | 0.00 |
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 replicas@?s 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.