Extracting guarantees from chaos
Communications of the ACM
Replica management should be a game
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
The Farsite project: a retrospective
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Efficient replica maintenance for distributed storage systems
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Assignment Problems
| Hi-index | 0.00 |
We introduce NileStore, a replica placement algorithm based on an economical model for use in Peer-assisted cloud storage. The algorithm uses storage and bandwidth resources of peers to offload the cloud provider's resources. We formulate the placement problem as a linear task assignment problem where the aim is to minimize time needed for file replicas to reach a certain desired threshold. Using simulation, We reduce the probability of a file being served from the provider's servers by more than 97.5% under realistic network conditions.