ACM Home Page
Please provide us with feedback. Feedback
On the minimum delay peer-to-peer video streaming: how realtime can it be?
Full text PdfPdf (265 KB)
Source
International Multimedia Conference archive
Proceedings of the 15th international conference on Multimedia table of contents
Augsburg, Germany
SESSION: Systems 1 - streaming table of contents
Pages: 127 - 136  
Year of Publication: 2007
ISBN:978-1-59593-702-5
Author
Yong Liu  Polytechnic University, Brooklyn, NY
Sponsors
ACM: Association for Computing Machinery
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGMULTIMEDIA: ACM Special Interest Group on Multimedia
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 165,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1291233.1291259
What is a DOI?

ABSTRACT

P2P systems exploit the uploading bandwidth of individual peers to distribute content at low server cost. While the P2P bandwidth sharing design is very efficient for bandwidth sensitive applications, it imposes a fundamental performance constraint for delay sensitive applications: the uploading bandwidth of a peer cannot be utilized to upload a piece of content until it completes the download of that content. This constraint sets up a limit on how fast a piece of content can be disseminated to all peers in a P2P system. In this paper, we theoretically study the impact of this inherent delay constraint and derive the minimum delay bounds for realtime P2P streaming systems. We show that the bandwidth heterogeneity among peers can be exploited to significantly improve the delay performance of all peers. We further propose a simple snow-ball streaming algorithm to approach the minimum delay bound in realtime P2P video streaming. Our analysis suggests that the proposed algorithm has better delay performance and more robust than existing tree-based streaming solutions. Insights brought forth by our study can be used to guide the design of new P2P systems with shorter startup delays.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
Hei, X., Liang, C., Liang, J., Liu, Y., and Ross, K. W. A measurement study of a large-scale P2P IPTV system. IEEE Transactions on Multimedia (November 2007).
 
4
5
 
6
Magharei, N., and Rejaie, R. Prime: Peer-to-Peer receiver-driven mesh-based streaming. In Proceedings of IEEE INFOCOM (2007).
 
7
Magharei, N., Rejaie, R., and Guo, Y. Mesh or multiple-tree: A comparative study of live p2p streaming approaches. In Proceedings of IEEE INFOCOM (2007).
 
8
Pai, V., Kumar, K., Tamilmani, K., Sambamurthy, V., and Mohr, A. Chainsaw: Eliminating trees from overlay multicast. In The Fourth International Workshop on Peer-to-Peer Systems (2005).
 
9
PPLive. PPLive Homepage. http://www.pplive.com.
 
10
PPStream. PPStream Homepage. http://www.ppstream.com.
11
 
12
Venkataraman, J. C. V., and Francis, P. Multi-tree unstructured peer-to-peer multicast. In Proceedings of 5th International Workshop on Peer-to-Peer Systems (2006).
 
13
Youtube. Youtube Homepage. http://www.youtube.com.
 
14
Zhang, M., Zhao, L., Tang, J. L. Y., and Yang, S. A peer-to-peer network for streaming multicast through the internet. In Proceedings of ACM Multimedia (2005).
 
15
Zhang, X., Liu, J., Li, B., and Yum, T.-S. P.DONet/CoolStreaming: A data-driven overlay network for live media streaming. In Proceedings of IEEE INFOCOM (2005).