On the minimum delay peer-to-peer video streaming

How realtime can it be?

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationProceedings of the Fifteenth ACM International Conference on Multimedia, MM'07
Pages127-136
Number of pages10
DOIs
StatePublished - 2007
Event15th ACM International Conference on Multimedia, MM'07 - Augsburg, Bavaria, Germany
Duration: Sep 24 2007Sep 29 2007

Other

Other15th ACM International Conference on Multimedia, MM'07
CountryGermany
CityAugsburg, Bavaria
Period9/24/079/29/07

Fingerprint

Video streaming
Bandwidth
Snow
Servers
Costs

Keywords

  • Delay bound
  • Peer-to-peer streaming
  • Realtime

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Liu, Y. (2007). On the minimum delay peer-to-peer video streaming: How realtime can it be? In Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07 (pp. 127-136) https://doi.org/10.1145/1291233.1291259

On the minimum delay peer-to-peer video streaming : How realtime can it be? / Liu, Yong.

Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07. 2007. p. 127-136.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Liu, Y 2007, On the minimum delay peer-to-peer video streaming: How realtime can it be? in Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07. pp. 127-136, 15th ACM International Conference on Multimedia, MM'07, Augsburg, Bavaria, Germany, 9/24/07. https://doi.org/10.1145/1291233.1291259
Liu Y. On the minimum delay peer-to-peer video streaming: How realtime can it be? In Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07. 2007. p. 127-136 https://doi.org/10.1145/1291233.1291259
Liu, Yong. / On the minimum delay peer-to-peer video streaming : How realtime can it be?. Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07. 2007. pp. 127-136
@inproceedings{e3fd2393a0e94993b0fcddd8196d3361,
title = "On the minimum delay peer-to-peer video streaming: How realtime can it be?",
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.",
keywords = "Delay bound, Peer-to-peer streaming, Realtime",
author = "Yong Liu",
year = "2007",
doi = "10.1145/1291233.1291259",
language = "English (US)",
isbn = "9781595937025",
pages = "127--136",
booktitle = "Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07",

}

TY - GEN

T1 - On the minimum delay peer-to-peer video streaming

T2 - How realtime can it be?

AU - Liu, Yong

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Delay bound

KW - Peer-to-peer streaming

KW - Realtime

UR - http://www.scopus.com/inward/record.url?scp=37849049005&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37849049005&partnerID=8YFLogxK

U2 - 10.1145/1291233.1291259

DO - 10.1145/1291233.1291259

M3 - Conference contribution

SN - 9781595937025

SP - 127

EP - 136

BT - Proceedings of the Fifteenth ACM International Conference on Multimedia, MM'07

ER -