Object Replication Strategies in Content Distribution Networks (2001) [84 citations — 0 self]
Abstract:
Recently the Internet has witnessed the emergence of content distribution networks (CDNs). In this paper we study the problem of optimally replicating objects in CDN servers. In our model, each Internet Au-tonomous System (AS) is a node with finite storage ca-pacity for replicating objects. The optimization problem is to replicate objects so that when clients fetch objects from the nearest CDN server with the requested object, the average number of ASs traversed is minimized. We formulate this problem as a combinatorial optimization problem. We show that this optimization problem is NP complete. We develop four natural heuristics and compare them numerically using real Internet topology data. We find that the best results are obtained with heuristics that have all the CDN servers cooperating in making the replication decisions. We also develop a model for studying the benefits of cooperation between nodes, which provides insight into peer-to-peer content distribution.
Citations
| 7716 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 554 | Web Caching and Zipf-like Distributions: Evidence and Implications – Breslau, Cao, et al. - 1999 |
| 232 | On inferring autonomous system relationships in the internet – Gao |
| 169 | On the placement of Web server replica – Qiu, Padmanabhan, et al. - 2001 |
| 99 | The Content and Access Dynamic of a Busy Web Site: Findings and Implications – Padmanabhan, Qiu - 2000 |
| 80 | The cache location problem – Krishnan, Raz, et al. |
| 51 | On the optimal placement of web proxies in the internet – Li, Golin, et al. - 1999 |
| 46 | GreedyDual* Web caching algorithm: exploiting the two sources of temporal locality in Web request streams – Jin, Bestavros - 2001 |
| 27 | Optimal allocation of electronic content – Cidon, Kutten, et al. - 2001 |
| 2 | views project homepage – Route |

