Threshold bipolar scheduling for P2P live streaming

Chunxi Li, Changjia Chen, Yong Liu, Baoxian Zhang

Research output: Contribution to journalArticle

Abstract

In P2P live streaming, the startup mechanism used by peers directly determines their streaming performance when they first join a channel or recover from playback freezes. However, there has been no systematic study of peer behaviors and streaming strategies in their startup stages. Motivated by a measurement study of peer startup behaviors in real P2P live streaming systems, we propose a simple and effective hybrid chunk fetching strategy, called Threshold Bipolar (TB), which partitions the buffer of a peer into head and tail parts and employs different chunk download strategies for the two parts. According to the TB strategy, a peer downloads chunks in the head part using selfish strategies, like the Greedy. Once the head part is fully filled, it needs to use altruistic fetching strategies, like the Rarest First or the Random, to download chunks in the tail part. We study the design choices of the major parameters of the proposed TB strategy. In particular, we propose to dynamically adjust the TB threshold to tradeoff between a peer's selfishness and altruism based on the system-wide streaming performance. We further develop analytical models to characterize the buffer progresses of peers in startup stages. Through extensive simulations, we demonstrate that the proposed TB strategy outperforms the existing P2P chunk fetching strategies and is robust against flash-crowd.

Original languageEnglish (US)
Pages (from-to)154-169
Number of pages16
JournalComputer Networks
Volume70
DOIs
StatePublished - Sep 9 2014

Fingerprint

Analytical models
Scheduling

Keywords

  • Fetching strategy
  • P2P live streaming
  • Performance modeling
  • Startup process

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Threshold bipolar scheduling for P2P live streaming. / Li, Chunxi; Chen, Changjia; Liu, Yong; Zhang, Baoxian.

In: Computer Networks, Vol. 70, 09.09.2014, p. 154-169.

Research output: Contribution to journalArticle

Li, Chunxi ; Chen, Changjia ; Liu, Yong ; Zhang, Baoxian. / Threshold bipolar scheduling for P2P live streaming. In: Computer Networks. 2014 ; Vol. 70. pp. 154-169.
@article{a16c683d1cc94756abe912f20046ef5b,
title = "Threshold bipolar scheduling for P2P live streaming",
abstract = "In P2P live streaming, the startup mechanism used by peers directly determines their streaming performance when they first join a channel or recover from playback freezes. However, there has been no systematic study of peer behaviors and streaming strategies in their startup stages. Motivated by a measurement study of peer startup behaviors in real P2P live streaming systems, we propose a simple and effective hybrid chunk fetching strategy, called Threshold Bipolar (TB), which partitions the buffer of a peer into head and tail parts and employs different chunk download strategies for the two parts. According to the TB strategy, a peer downloads chunks in the head part using selfish strategies, like the Greedy. Once the head part is fully filled, it needs to use altruistic fetching strategies, like the Rarest First or the Random, to download chunks in the tail part. We study the design choices of the major parameters of the proposed TB strategy. In particular, we propose to dynamically adjust the TB threshold to tradeoff between a peer's selfishness and altruism based on the system-wide streaming performance. We further develop analytical models to characterize the buffer progresses of peers in startup stages. Through extensive simulations, we demonstrate that the proposed TB strategy outperforms the existing P2P chunk fetching strategies and is robust against flash-crowd.",
keywords = "Fetching strategy, P2P live streaming, Performance modeling, Startup process",
author = "Chunxi Li and Changjia Chen and Yong Liu and Baoxian Zhang",
year = "2014",
month = "9",
day = "9",
doi = "10.1016/j.comnet.2014.05.011",
language = "English (US)",
volume = "70",
pages = "154--169",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",

}

TY - JOUR

T1 - Threshold bipolar scheduling for P2P live streaming

AU - Li, Chunxi

AU - Chen, Changjia

AU - Liu, Yong

AU - Zhang, Baoxian

PY - 2014/9/9

Y1 - 2014/9/9

N2 - In P2P live streaming, the startup mechanism used by peers directly determines their streaming performance when they first join a channel or recover from playback freezes. However, there has been no systematic study of peer behaviors and streaming strategies in their startup stages. Motivated by a measurement study of peer startup behaviors in real P2P live streaming systems, we propose a simple and effective hybrid chunk fetching strategy, called Threshold Bipolar (TB), which partitions the buffer of a peer into head and tail parts and employs different chunk download strategies for the two parts. According to the TB strategy, a peer downloads chunks in the head part using selfish strategies, like the Greedy. Once the head part is fully filled, it needs to use altruistic fetching strategies, like the Rarest First or the Random, to download chunks in the tail part. We study the design choices of the major parameters of the proposed TB strategy. In particular, we propose to dynamically adjust the TB threshold to tradeoff between a peer's selfishness and altruism based on the system-wide streaming performance. We further develop analytical models to characterize the buffer progresses of peers in startup stages. Through extensive simulations, we demonstrate that the proposed TB strategy outperforms the existing P2P chunk fetching strategies and is robust against flash-crowd.

AB - In P2P live streaming, the startup mechanism used by peers directly determines their streaming performance when they first join a channel or recover from playback freezes. However, there has been no systematic study of peer behaviors and streaming strategies in their startup stages. Motivated by a measurement study of peer startup behaviors in real P2P live streaming systems, we propose a simple and effective hybrid chunk fetching strategy, called Threshold Bipolar (TB), which partitions the buffer of a peer into head and tail parts and employs different chunk download strategies for the two parts. According to the TB strategy, a peer downloads chunks in the head part using selfish strategies, like the Greedy. Once the head part is fully filled, it needs to use altruistic fetching strategies, like the Rarest First or the Random, to download chunks in the tail part. We study the design choices of the major parameters of the proposed TB strategy. In particular, we propose to dynamically adjust the TB threshold to tradeoff between a peer's selfishness and altruism based on the system-wide streaming performance. We further develop analytical models to characterize the buffer progresses of peers in startup stages. Through extensive simulations, we demonstrate that the proposed TB strategy outperforms the existing P2P chunk fetching strategies and is robust against flash-crowd.

KW - Fetching strategy

KW - P2P live streaming

KW - Performance modeling

KW - Startup process

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

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

U2 - 10.1016/j.comnet.2014.05.011

DO - 10.1016/j.comnet.2014.05.011

M3 - Article

VL - 70

SP - 154

EP - 169

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -