Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10339377 | Computer Networks | 2014 | 13 Pages |
Abstract
We first formulate the joint optimization problem and prove that it is NP-hard. We then propose a simple and distributed algorithm called CR-SS-SP to address it. CR-SS-SP achieves good storage allocation, replicates segments collaboratively and adaptively to achieve high locality, and selects servers efficiently with a simple lookup. Simulation results on both Internet-like and real ISP topologies show that CR-SS-SP significantly outperforms existing and state-of-the-art approaches by a wide margin (often by multiple times).
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
Dongni Ren, S.-H. Gary Chan, Guangyu Shi, Hongbo Zhang,