Quality-aware segment transmission scheduling in peer-to-peer streaming systems

Cheng Hsin Hsu, Mohamed Hefeeda

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

17 Citations (Scopus)

Abstract

In peer-to-peer (P2P) mesh-based streaming systems, each video sequence is typically divided into segments, which are then streamed from multiple senders to a receiver. The receiver needs to coordinate the senders by specifying a transmission schedule for each of them. We consider the scheduling problem in both live and on-demand P2P streaming systems. We formulate the problem of scheduling segment transmission in order to maximize the perceived video quality of the receiver. We prove that this problem is NP-Complete. We present an integer linear programming (ILP) formulation for this problem, and we optimally solve it using an ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time streaming systems. Thus, we propose a polynomial-time approximation algorithm, which yields transmission schedules with analytical guarantees on the worst-case performance. More precisely, we show that the approximation factor is at most 3, compared to the absolutely optimal solution as a benchmark. We implement the proposed approximation and optimal algorithms in a packet-level simulator for P2P streaming systems. We also implement two other scheduling algorithms proposed in the literature and used in popular P2P streaming systems. By simulating large P2P systems and streaming nine real video sequences with diverse visual and motion characteristics, we demonstrate that our proposed approximation algorithm: (i) produces near-optimal perceived video quality, (ii) can run in real time, and (iii) outperforms other algorithms in terms of perceived video quality, smoothness of the rendered videos, and balancing the load across sending peers. For example, our simulation results indicate that the proposed algorithm outperforms heuristic algorithms used in current systems by up to 8 dB in perceived video quality and up to 20% in continuity index.

Original languageEnglish
Title of host publicationMMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems
Pages169-179
Number of pages11
DOIs
Publication statusPublished - 29 Apr 2010
Externally publishedYes
Event2010 ACM SIGMM Conference on Multimedia Systems, MMSys'10 - Phoenix, AZ, United States
Duration: 22 Feb 201023 Feb 2010

Other

Other2010 ACM SIGMM Conference on Multimedia Systems, MMSys'10
CountryUnited States
CityPhoenix, AZ
Period22/2/1023/2/10

Fingerprint

Scheduling
Approximation algorithms
Linear programming
Heuristic algorithms
Scheduling algorithms
Computational complexity
Simulators
Polynomials

Keywords

  • Optimization
  • Peer-to-peer streaming
  • Perceived video quality
  • Transmission scheduling
  • Video streaming

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Hsu, C. H., & Hefeeda, M. (2010). Quality-aware segment transmission scheduling in peer-to-peer streaming systems. In MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems (pp. 169-179) https://doi.org/10.1145/1730836.1730857

Quality-aware segment transmission scheduling in peer-to-peer streaming systems. / Hsu, Cheng Hsin; Hefeeda, Mohamed.

MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems. 2010. p. 169-179.

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

Hsu, CH & Hefeeda, M 2010, Quality-aware segment transmission scheduling in peer-to-peer streaming systems. in MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems. pp. 169-179, 2010 ACM SIGMM Conference on Multimedia Systems, MMSys'10, Phoenix, AZ, United States, 22/2/10. https://doi.org/10.1145/1730836.1730857
Hsu CH, Hefeeda M. Quality-aware segment transmission scheduling in peer-to-peer streaming systems. In MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems. 2010. p. 169-179 https://doi.org/10.1145/1730836.1730857
Hsu, Cheng Hsin ; Hefeeda, Mohamed. / Quality-aware segment transmission scheduling in peer-to-peer streaming systems. MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems. 2010. pp. 169-179
@inproceedings{5b25372e68cf4113b7b57f2b1e6d7c7d,
title = "Quality-aware segment transmission scheduling in peer-to-peer streaming systems",
abstract = "In peer-to-peer (P2P) mesh-based streaming systems, each video sequence is typically divided into segments, which are then streamed from multiple senders to a receiver. The receiver needs to coordinate the senders by specifying a transmission schedule for each of them. We consider the scheduling problem in both live and on-demand P2P streaming systems. We formulate the problem of scheduling segment transmission in order to maximize the perceived video quality of the receiver. We prove that this problem is NP-Complete. We present an integer linear programming (ILP) formulation for this problem, and we optimally solve it using an ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time streaming systems. Thus, we propose a polynomial-time approximation algorithm, which yields transmission schedules with analytical guarantees on the worst-case performance. More precisely, we show that the approximation factor is at most 3, compared to the absolutely optimal solution as a benchmark. We implement the proposed approximation and optimal algorithms in a packet-level simulator for P2P streaming systems. We also implement two other scheduling algorithms proposed in the literature and used in popular P2P streaming systems. By simulating large P2P systems and streaming nine real video sequences with diverse visual and motion characteristics, we demonstrate that our proposed approximation algorithm: (i) produces near-optimal perceived video quality, (ii) can run in real time, and (iii) outperforms other algorithms in terms of perceived video quality, smoothness of the rendered videos, and balancing the load across sending peers. For example, our simulation results indicate that the proposed algorithm outperforms heuristic algorithms used in current systems by up to 8 dB in perceived video quality and up to 20{\%} in continuity index.",
keywords = "Optimization, Peer-to-peer streaming, Perceived video quality, Transmission scheduling, Video streaming",
author = "Hsu, {Cheng Hsin} and Mohamed Hefeeda",
year = "2010",
month = "4",
day = "29",
doi = "10.1145/1730836.1730857",
language = "English",
isbn = "9781605589145",
pages = "169--179",
booktitle = "MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems",

}

TY - GEN

T1 - Quality-aware segment transmission scheduling in peer-to-peer streaming systems

AU - Hsu, Cheng Hsin

AU - Hefeeda, Mohamed

PY - 2010/4/29

Y1 - 2010/4/29

N2 - In peer-to-peer (P2P) mesh-based streaming systems, each video sequence is typically divided into segments, which are then streamed from multiple senders to a receiver. The receiver needs to coordinate the senders by specifying a transmission schedule for each of them. We consider the scheduling problem in both live and on-demand P2P streaming systems. We formulate the problem of scheduling segment transmission in order to maximize the perceived video quality of the receiver. We prove that this problem is NP-Complete. We present an integer linear programming (ILP) formulation for this problem, and we optimally solve it using an ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time streaming systems. Thus, we propose a polynomial-time approximation algorithm, which yields transmission schedules with analytical guarantees on the worst-case performance. More precisely, we show that the approximation factor is at most 3, compared to the absolutely optimal solution as a benchmark. We implement the proposed approximation and optimal algorithms in a packet-level simulator for P2P streaming systems. We also implement two other scheduling algorithms proposed in the literature and used in popular P2P streaming systems. By simulating large P2P systems and streaming nine real video sequences with diverse visual and motion characteristics, we demonstrate that our proposed approximation algorithm: (i) produces near-optimal perceived video quality, (ii) can run in real time, and (iii) outperforms other algorithms in terms of perceived video quality, smoothness of the rendered videos, and balancing the load across sending peers. For example, our simulation results indicate that the proposed algorithm outperforms heuristic algorithms used in current systems by up to 8 dB in perceived video quality and up to 20% in continuity index.

AB - In peer-to-peer (P2P) mesh-based streaming systems, each video sequence is typically divided into segments, which are then streamed from multiple senders to a receiver. The receiver needs to coordinate the senders by specifying a transmission schedule for each of them. We consider the scheduling problem in both live and on-demand P2P streaming systems. We formulate the problem of scheduling segment transmission in order to maximize the perceived video quality of the receiver. We prove that this problem is NP-Complete. We present an integer linear programming (ILP) formulation for this problem, and we optimally solve it using an ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time streaming systems. Thus, we propose a polynomial-time approximation algorithm, which yields transmission schedules with analytical guarantees on the worst-case performance. More precisely, we show that the approximation factor is at most 3, compared to the absolutely optimal solution as a benchmark. We implement the proposed approximation and optimal algorithms in a packet-level simulator for P2P streaming systems. We also implement two other scheduling algorithms proposed in the literature and used in popular P2P streaming systems. By simulating large P2P systems and streaming nine real video sequences with diverse visual and motion characteristics, we demonstrate that our proposed approximation algorithm: (i) produces near-optimal perceived video quality, (ii) can run in real time, and (iii) outperforms other algorithms in terms of perceived video quality, smoothness of the rendered videos, and balancing the load across sending peers. For example, our simulation results indicate that the proposed algorithm outperforms heuristic algorithms used in current systems by up to 8 dB in perceived video quality and up to 20% in continuity index.

KW - Optimization

KW - Peer-to-peer streaming

KW - Perceived video quality

KW - Transmission scheduling

KW - Video streaming

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

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

U2 - 10.1145/1730836.1730857

DO - 10.1145/1730836.1730857

M3 - Conference contribution

AN - SCOPUS:77951289876

SN - 9781605589145

SP - 169

EP - 179

BT - MMSys'10 - Proceedings of the 2010 ACM SIGMM Conference on Multimedia Systems

ER -