The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Parameter Selection in Particle Swarm Optimization
EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Data Grids, Collections, and Grid Bricks
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Reperasure: Replication Protocol Using Erasure-Code in Peer-to-Peer Storage Network
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
PeerStore: Better Performance by Relaxing in Peer-to-Peer Backup
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Erasure Code Replication Revisited
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Pastiche: making backup cheap and easy
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
A heterogeneous storage grid enabled by grid service
ACM SIGOPS Operating Systems Review
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Total recall: system support for automated availability management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Efficient replica maintenance for distributed storage systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Proactive replication in distributed storage systems using machine availability estimation
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
P2P '08 Proceedings of the 2008 Eighth International Conference on Peer-to-Peer Computing
A break in the clouds: towards a cloud definition
ACM SIGCOMM Computer Communication Review
Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage Systems
ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Nebulas: using distributed voluntary resources to build clouds
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Redundancy schemes for high availability in DHTs
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
High availability in DHTs: erasure coding vs. replication
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Using free cloud storage services for distributed evolutionary algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Cloud-based evolutionary algorithms: An algorithmic study
Natural Computing: an international journal
| Hi-index | 0.00 |
Nowadays, data storage requirements from end-users are growing, demanding more capacity, more reliability and the capability to access information from anywhere. Cloud storage services meet this demand by providing transparent and reliable storage solutions. Most of these solutions are built on distributed infrastructures that rely on data redundancy to guarantee a 100% of data availability. Unfortunately, existing redundancy schemes very often assume that resources are homogeneous, an assumption that may increase storage costs in heterogeneous infrastructures - e.g., clouds built of voluntary resources. In this work, we analyze how distributed redundancy schemes can be optimally deployed over heterogeneous infrastructures. Specifically, we are interested in infrastructures where nodes present different online availabilities. Considering these heterogeneities, we present a mechanism to measure data availability more precisely than existing works. Using this mechanism, we infer the optimal data placement policy that reduces the redundancy used, and then its associated overheads. In heterogeneous settings, our results show that data redundancy can be reduced up to 70%.