HKUST Institutional Repository >
Electronic and Computer Engineering >
ECE Conference Papers >
Please use this identifier to cite or link to this item:
|Title: ||Towards low-redundancy push-pull P2P live streaming|
|Authors: ||Li, Zhenjiang|
Tsang, Danny H. K.
|Keywords: ||Peer-to-peer live streaming|
|Issue Date: ||Jul-2008 |
|Citation: ||To be published in Proceedings of 5th ICST International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness (QShine 2008), HKSAR, 28-31 July 2008|
|Abstract: ||P2P live streaming systems are developed in two major approaches: tree-push versus mesh-pull. The hybrid push-pull streaming, as an emerging and promising approach, offers a good tradeoff between traffic overhead and system throughput. In this paper, we demonstrate that video redundancy is a large contributor of the traffic overhead in push-pull systems. To reduce the traffic overhead, we propose simple but effective sub-stream scheduling and re-scheduling mechanisms, implemented in a push-pull streaming prototype called Low-redundancy Streaming ( LStreaming ). To demonstrate its effectiveness on reducing the traffic overhead, we conduct both simulation and prototype experiments and compare the proposed LStreaming with random mesh-pull and GridMedia. The simulation results show that LStreaming significantly reduces the total traffic overhead, i.e., up to 33% and 37% reduction compared with mesh-pull and GridMedia in dynamic P2P environments, respectively. LStreaming also achieves the throughput, more close to the optimal value than the other two schemes, and sustains a better video playback quality. The prototype experiments show that LStreaming is practical and achieves the expected performance.|
|Rights: ||© ICST 2008. This is the author's version of the work. It is posted here by permission of ICST for non-commercial access and personal use by others.|
|Appears in Collections:||ECE Conference Papers|
Files in This Item:
All items in this Repository are protected by copyright, with all rights reserved.