HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Pattern-push : a low-delay mesh-push scheduling for live peer-to-peer streaming|
|Authors: ||Chan, Shueng-Han Gary|
Begen, A. C.
|Keywords: ||Live peer-to-peer streaming|
|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. 1158-1161.|
|Abstract: ||In live peer-to-peer (P2P) streaming, each peer (child) has a number of supplying parents whose packets have to be scheduled and delivered in time for continuous playback at the child. It is challenging to develop a scheduling algorithm that achieves low delay given heterogeneous bandwidth, propagation delays and available content in all the parents. This paper proposes a novel, simple and effective scheduling scheme called Pattern-Push. As compared to the traditional mesh-pull, pattern-push does not require continuous buffermap advertisements from the parents, and operates on the packet level instead of the larger segment level. In pattern-push, each parent pushes its packets according to a pattern as indicated by a starting packet ID and a cycle bitmap. Pattern-push requires only minimal feedback from the child, as the pattern only needs to be changed when the child detects a marked change in network conditions or its parents. Simulation results show that pattern-push achieves a significantly lower delay and overhead as compared with both traditional and recent scheduling algorithms proposed in the literature.|
|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:
All items in this Repository are protected by copyright, with all rights reserved.