Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/6563

Optimizing segment caching for peer-to-peer on-demand streaming

Authors Tang, H.-S.
Chan, S.-H.G.
Li, H.
Issue Date 2009
Source Proceedings - 2009 IEEE International Conference on Multimedia and Expo, ICME 2009, 2009, p. 810-813
Summary 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 nearoptimal performance, and lower peer workload and segment distance as compared with other schemes. ©2009 IEEE.
Subjects
ISSN 1945-7871
ISBN 978-1-4244-4290-4
Rights © 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Language English
Format Conference paper
Access View full-text via DOI
View full-text via Scopus
View full-text via Web of Science
Find@HKUST
Files in this item:
File Description Size Format
optimizing.pdf 106.33 kB Adobe PDF