Replica Placement in Peer-Assisted Clouds: An Economic Approach

• Main Authors: Ali-Eldin, Ahmed, El-Ansary, Sameh
• Other Authors: Nile University (NU), Pascal Felber, Romain Rouvoy, TC 6, WG 6.1
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2011
• Subjects: Peer to peer computing; cloud storage; [INFO]Computer Science [cs]; [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]; Iceland
• Online Access: https://hal.inria.fr/hal-01583581; https://hal.inria.fr/hal-01583581/document; https://hal.inria.fr/hal-01583581/file/978-3-642-21387-8_16_Chapter.pdf; https://doi.org/10.1007/978-3-642-21387-8_16

International audience 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.