Efficient algorithms for multi-sender data transmission in swarm-based peer-to-peer streaming systems

Yuanbin Shen, Cheng Hsin Hsu, Mohamed Hefeeda

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

In mesh-based peer-to-peer (P2P) streaming systems, each video sequence is 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 problem of scheduling segment transmission in P2P streaming systems, where different segments have different weights in terms of quality improvements to the received video. Our goal is to compute the transmission schedule for each receiver in order to maximize the perceived video quality. We first show that this scheduling problem is NP-Complete. We then present an integer linear programming (ILP) formulation for it, so that it can be solved with any ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time P2P streaming systems. Thus, we propose two approximation algorithms to solve this segment scheduling problem. These algorithms provide theoretical guarantees on the worst-case performance. The first algorithm considers the weight of each video segment. The second algorithm is simpler and it assumes that segments carry equal weights. We analyze the performance and complexity of the two algorithms. In addition, we rigorously evaluate the proposed algorithms with simulations and experiments using a prototype implementation. Our simulation and experimental results show that the proposed algorithms outperform other algorithms that are commonly used in deployed P2P streaming systems and that have been recently proposed in the literature.

Original languageEnglish
Article number5702270
Pages (from-to)762-775
Number of pages14
JournalIEEE Transactions on Multimedia
Volume13
Issue number4
DOIs
Publication statusPublished - 1 Aug 2011
Externally publishedYes

Fingerprint

Data communication systems
Scheduling
Linear programming
Approximation algorithms
Computational complexity
Experiments

Keywords

  • Peer-to-peer networks
  • quality optimization
  • transmission scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Media Technology
  • Computer Science Applications

Cite this

Efficient algorithms for multi-sender data transmission in swarm-based peer-to-peer streaming systems. / Shen, Yuanbin; Hsu, Cheng Hsin; Hefeeda, Mohamed.

In: IEEE Transactions on Multimedia, Vol. 13, No. 4, 5702270, 01.08.2011, p. 762-775.

Research output: Contribution to journalArticle

Shen, Yuanbin ; Hsu, Cheng Hsin ; Hefeeda, Mohamed. / Efficient algorithms for multi-sender data transmission in swarm-based peer-to-peer streaming systems. In: IEEE Transactions on Multimedia. 2011 ; Vol. 13, No. 4. pp. 762-775.
@article{1c93d2e680574c01a6eb0e7e2ae496ed,
title = "Efficient algorithms for multi-sender data transmission in swarm-based peer-to-peer streaming systems",
abstract = "In mesh-based peer-to-peer (P2P) streaming systems, each video sequence is 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 problem of scheduling segment transmission in P2P streaming systems, where different segments have different weights in terms of quality improvements to the received video. Our goal is to compute the transmission schedule for each receiver in order to maximize the perceived video quality. We first show that this scheduling problem is NP-Complete. We then present an integer linear programming (ILP) formulation for it, so that it can be solved with any ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time P2P streaming systems. Thus, we propose two approximation algorithms to solve this segment scheduling problem. These algorithms provide theoretical guarantees on the worst-case performance. The first algorithm considers the weight of each video segment. The second algorithm is simpler and it assumes that segments carry equal weights. We analyze the performance and complexity of the two algorithms. In addition, we rigorously evaluate the proposed algorithms with simulations and experiments using a prototype implementation. Our simulation and experimental results show that the proposed algorithms outperform other algorithms that are commonly used in deployed P2P streaming systems and that have been recently proposed in the literature.",
keywords = "Peer-to-peer networks, quality optimization, transmission scheduling",
author = "Yuanbin Shen and Hsu, {Cheng Hsin} and Mohamed Hefeeda",
year = "2011",
month = "8",
day = "1",
doi = "10.1109/TMM.2011.2108644",
language = "English",
volume = "13",
pages = "762--775",
journal = "IEEE Transactions on Multimedia",
issn = "1520-9210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Efficient algorithms for multi-sender data transmission in swarm-based peer-to-peer streaming systems

AU - Shen, Yuanbin

AU - Hsu, Cheng Hsin

AU - Hefeeda, Mohamed

PY - 2011/8/1

Y1 - 2011/8/1

N2 - In mesh-based peer-to-peer (P2P) streaming systems, each video sequence is 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 problem of scheduling segment transmission in P2P streaming systems, where different segments have different weights in terms of quality improvements to the received video. Our goal is to compute the transmission schedule for each receiver in order to maximize the perceived video quality. We first show that this scheduling problem is NP-Complete. We then present an integer linear programming (ILP) formulation for it, so that it can be solved with any ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time P2P streaming systems. Thus, we propose two approximation algorithms to solve this segment scheduling problem. These algorithms provide theoretical guarantees on the worst-case performance. The first algorithm considers the weight of each video segment. The second algorithm is simpler and it assumes that segments carry equal weights. We analyze the performance and complexity of the two algorithms. In addition, we rigorously evaluate the proposed algorithms with simulations and experiments using a prototype implementation. Our simulation and experimental results show that the proposed algorithms outperform other algorithms that are commonly used in deployed P2P streaming systems and that have been recently proposed in the literature.

AB - In mesh-based peer-to-peer (P2P) streaming systems, each video sequence is 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 problem of scheduling segment transmission in P2P streaming systems, where different segments have different weights in terms of quality improvements to the received video. Our goal is to compute the transmission schedule for each receiver in order to maximize the perceived video quality. We first show that this scheduling problem is NP-Complete. We then present an integer linear programming (ILP) formulation for it, so that it can be solved with any ILP solver. This optimal solution, however, is computationally expensive and is not suitable for real-time P2P streaming systems. Thus, we propose two approximation algorithms to solve this segment scheduling problem. These algorithms provide theoretical guarantees on the worst-case performance. The first algorithm considers the weight of each video segment. The second algorithm is simpler and it assumes that segments carry equal weights. We analyze the performance and complexity of the two algorithms. In addition, we rigorously evaluate the proposed algorithms with simulations and experiments using a prototype implementation. Our simulation and experimental results show that the proposed algorithms outperform other algorithms that are commonly used in deployed P2P streaming systems and that have been recently proposed in the literature.

KW - Peer-to-peer networks

KW - quality optimization

KW - transmission scheduling

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

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

U2 - 10.1109/TMM.2011.2108644

DO - 10.1109/TMM.2011.2108644

M3 - Article

VL - 13

SP - 762

EP - 775

JO - IEEE Transactions on Multimedia

JF - IEEE Transactions on Multimedia

SN - 1520-9210

IS - 4

M1 - 5702270

ER -