Placement algorithms for hierarchical cooperative caching
Journal of Algorithms
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Taming the torrent: a practical approach to reducing cross-isp traffic in peer-to-peer systems
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
A class of mean field interaction models for computer and communication systems
Performance Evaluation
On ISP-friendly rate allocation for peer-assisted VoD
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Understanding hybrid CDN-P2P: why limelight needs its own Red Swoosh
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Approximation Algorithms for Data Placement Problems
SIAM Journal on Computing
Greening the internet with nano data centers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Incentivizing peer-assisted services: a fluid shapley value approach
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed caching algorithms for content distribution networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Temporal locality in today's content caching: why it matters and how to model it
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
We consider a content delivery architecture based on geographically dispersed groups of "last-mile" CDN servers, e.g., set-top boxes located within users' homes. These servers may belong to administratively separate domains, such as multiple ISPs. We propose a set of scalable, adaptive mechanisms to jointly manage content replication and request routing within this architecture. Relying on primal-dual methods and fluid-limit techniques, we formally prove the optimality of our design. We further evaluate its performance on both synthetic and trace-driven simulations, based on real BitTorrent traces, and observe a reduction of network costs by more than 50% over traditional mechanisms such as LRU/LFU with closest request routing.