Replica Placement in Peer-Assisted Clouds: An Economic Approach [chapter]

Ahmed Ali-Eldin, Sameh El-Ansary
2011 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-21387-8_16 fatcat:wg6u2xvkbfevjl2xfhbb67d7se