Hierarchically clustered P2P video streaming: Design, implementation, and evaluation

Yang Guo, Chao Liang, Yong Liu

Research output: Contribution to journalArticle

Abstract

P2P based live streaming has been gaining popularity. The new generation P2P live streaming systems not only attract a large number of viewers, but also support better video quality by streaming the content at higher bit-rate. In this paper, we propose a novel P2P streaming framework, called Hierarchically Clustered P2P Video Streaming, or HCPS, that can support the streaming rate approaching the optimal upper bound while accommodating large viewer population. The scalability comes with the hierarchical overlay architecture by grouping peers into clusters and forming a hierarchy among them. Peers are assigned to appropriate cluster so as to balance the bandwidth resources across clusters and maximize the supportable streaming rate. Furthermore, individual peers perform distributed queue-based scheduling algorithms to determine how to retrieve data chunks from source and neighboring peers, and how to utilize its uplink bandwidth to serve data chunks to other peers. We show that queue-based scheduling algorithms allow to fully utilize peers' uplink bandwidths, and HCPS supports the streaming rate close to the optimum in practical network environment. The prototype of HCPS is implemented and various design issues/tradeoffs are investigated. Experiments over the PlanetLab further demonstrate the effectiveness of HCPS design.

Original languageEnglish (US)
Pages (from-to)3432-3445
Number of pages14
JournalComputer Networks
Volume56
Issue number15
DOIs
StatePublished - Oct 15 2012

Fingerprint

Video streaming
Scheduling algorithms
Bandwidth
Scalability
Experiments

Keywords

  • Hierarchical clustering
  • Optimal scheduling
  • Peer-to-Peer
  • Streaming

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Hierarchically clustered P2P video streaming : Design, implementation, and evaluation. / Guo, Yang; Liang, Chao; Liu, Yong.

In: Computer Networks, Vol. 56, No. 15, 15.10.2012, p. 3432-3445.

Research output: Contribution to journalArticle

@article{8494eb6a4d30466b927c55f664c378be,
title = "Hierarchically clustered P2P video streaming: Design, implementation, and evaluation",
abstract = "P2P based live streaming has been gaining popularity. The new generation P2P live streaming systems not only attract a large number of viewers, but also support better video quality by streaming the content at higher bit-rate. In this paper, we propose a novel P2P streaming framework, called Hierarchically Clustered P2P Video Streaming, or HCPS, that can support the streaming rate approaching the optimal upper bound while accommodating large viewer population. The scalability comes with the hierarchical overlay architecture by grouping peers into clusters and forming a hierarchy among them. Peers are assigned to appropriate cluster so as to balance the bandwidth resources across clusters and maximize the supportable streaming rate. Furthermore, individual peers perform distributed queue-based scheduling algorithms to determine how to retrieve data chunks from source and neighboring peers, and how to utilize its uplink bandwidth to serve data chunks to other peers. We show that queue-based scheduling algorithms allow to fully utilize peers' uplink bandwidths, and HCPS supports the streaming rate close to the optimum in practical network environment. The prototype of HCPS is implemented and various design issues/tradeoffs are investigated. Experiments over the PlanetLab further demonstrate the effectiveness of HCPS design.",
keywords = "Hierarchical clustering, Optimal scheduling, Peer-to-Peer, Streaming",
author = "Yang Guo and Chao Liang and Yong Liu",
year = "2012",
month = "10",
day = "15",
doi = "10.1016/j.comnet.2012.06.020",
language = "English (US)",
volume = "56",
pages = "3432--3445",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "15",

}

TY - JOUR

T1 - Hierarchically clustered P2P video streaming

T2 - Design, implementation, and evaluation

AU - Guo, Yang

AU - Liang, Chao

AU - Liu, Yong

PY - 2012/10/15

Y1 - 2012/10/15

N2 - P2P based live streaming has been gaining popularity. The new generation P2P live streaming systems not only attract a large number of viewers, but also support better video quality by streaming the content at higher bit-rate. In this paper, we propose a novel P2P streaming framework, called Hierarchically Clustered P2P Video Streaming, or HCPS, that can support the streaming rate approaching the optimal upper bound while accommodating large viewer population. The scalability comes with the hierarchical overlay architecture by grouping peers into clusters and forming a hierarchy among them. Peers are assigned to appropriate cluster so as to balance the bandwidth resources across clusters and maximize the supportable streaming rate. Furthermore, individual peers perform distributed queue-based scheduling algorithms to determine how to retrieve data chunks from source and neighboring peers, and how to utilize its uplink bandwidth to serve data chunks to other peers. We show that queue-based scheduling algorithms allow to fully utilize peers' uplink bandwidths, and HCPS supports the streaming rate close to the optimum in practical network environment. The prototype of HCPS is implemented and various design issues/tradeoffs are investigated. Experiments over the PlanetLab further demonstrate the effectiveness of HCPS design.

AB - P2P based live streaming has been gaining popularity. The new generation P2P live streaming systems not only attract a large number of viewers, but also support better video quality by streaming the content at higher bit-rate. In this paper, we propose a novel P2P streaming framework, called Hierarchically Clustered P2P Video Streaming, or HCPS, that can support the streaming rate approaching the optimal upper bound while accommodating large viewer population. The scalability comes with the hierarchical overlay architecture by grouping peers into clusters and forming a hierarchy among them. Peers are assigned to appropriate cluster so as to balance the bandwidth resources across clusters and maximize the supportable streaming rate. Furthermore, individual peers perform distributed queue-based scheduling algorithms to determine how to retrieve data chunks from source and neighboring peers, and how to utilize its uplink bandwidth to serve data chunks to other peers. We show that queue-based scheduling algorithms allow to fully utilize peers' uplink bandwidths, and HCPS supports the streaming rate close to the optimum in practical network environment. The prototype of HCPS is implemented and various design issues/tradeoffs are investigated. Experiments over the PlanetLab further demonstrate the effectiveness of HCPS design.

KW - Hierarchical clustering

KW - Optimal scheduling

KW - Peer-to-Peer

KW - Streaming

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

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

U2 - 10.1016/j.comnet.2012.06.020

DO - 10.1016/j.comnet.2012.06.020

M3 - Article

AN - SCOPUS:84865742595

VL - 56

SP - 3432

EP - 3445

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 15

ER -