HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Optimizing segment caching for peer-to-peer on-demand streaming
Authors: Tang, Ho-Shing
Chan, Shueng-Han Gary
Li, Haochao
Keywords: Peer-to-peer on-demand streaming
Popularity-based caching algorithm
Multimedia content
Segment caching optimization
Issue Date: Jun-2009
Citation: Proceedings IEEE International Conference on Multimedia and Expo (ICME 2009), 28 June - 3 July 2009, New York, NY, USA, p. 810-813.
Abstract: 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.
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.
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
optimizing.pdf106KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.