Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Asynchronous distributed averaging on communication networks
IEEE/ACM Transactions on Networking (TON)
VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming
IEEE Journal on Selected Areas in Communications
A novel cache optimization algorithm and protocol for video streaming in pure peer-to-peer networks
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
| Hi-index | 0.01 |
In peer-to-peer (P2P) on-demand streaming applications, multimedia content is divided into segments and peers can seek any segments for viewing at anytime. Since different segments may be of different popularity, random segment caching would lead to a segment popularity-supply mismatch, and hence an uneven workload distribution among peers. Some popular segments may be far from peers, leading to inefficient search and streaming. In this paper, we study optimal segment caching for P2P on-demand streaming. We first state the segment caching optimization problem, and propose a centralized heuristic to solve it, which serves as a benchmark for other algorithms. We then propose a distributed caching algorithm termed POPCA (POPularity-based Caching Algorithm), in which each peer adaptively and independently replaces segments to minimize the popularity-supply discrepancy and the segment distance from peers. Through simulations, we show that POPCA achieves near-optimal performance, and lower peer workload and segment distance as compared with other schemes.