Abstract | ||
---|---|---|
We present a unified linear program formulation for optimal content delivery in content delivery networks (CDNs), taking into account various costs and constraints associated with content dissemination from the origin server to storage nodes, data storage, and the eventual fetching of content from storage nodes by end users. Our formulation can be used to achieve a variety of performance goals and system behavior, including the bounding of fetch delay, load balancing, and robustness against node and are failures. Simulation results suggest that our formulation performs significantly better than the traditional minimum k-median formulation for the delivery of multi I pie content, even under modest circumstances (small network, few objects, low storage budget, low dissemination costs). |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/CISS.2009.5054756 | 2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2 |
Keywords | Field | DocType |
content delivery network (CDN), network coding, subgraph selection, placement problem | Load management,Linear network coding,Content delivery network,Load balancing (computing),Computer science,Computer data storage,Server,Computer network,Robustness (computer science),Constrained optimization,Distributed computing | Conference |
Citations | PageRank | References |
5 | 0.43 | 15 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Derek Leong | 1 | 161 | 10.86 |
Tracey Ho | 2 | 775 | 59.30 |
Rebecca Cathey | 3 | 26 | 5.08 |