Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos

Kianoosh Mokhtarian, Mohamed Hefeeda

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

8 Citations (Scopus)

Abstract

We study streaming of scalable videos over peer-topeer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity.We formulate the problem of allocating this capacity for optimally serving scalable videos. We show that this problem is NP-complete, and propose two approximation algorithms to solve it. The first one allocates seeding resources for serving peers based on dynamic programming, and is more suitable for small seeding capacities (≤ 10 Mbps). The second algorithm follows a greedy approach and is more efficient for larger capacities. We evaluate the proposed algorithms analytically and in a simulated P2P streaming system. The results confirm the efficiency and near-optimality of the proposed algorithms, and show that higher-quality videos are delivered to peers if our algorithms are employed for allocating seed servers.

Original languageEnglish
Title of host publicationIEEE International Workshop on Quality of Service, IWQoS
DOIs
Publication statusPublished - 20 Nov 2009
Externally publishedYes
Event2009 17th International Workshop on Quality of Service, IWQoS 2009 - Charleston, SC, United States
Duration: 13 Jul 200915 Jul 2009

Other

Other2009 17th International Workshop on Quality of Service, IWQoS 2009
CountryUnited States
CityCharleston, SC
Period13/7/0915/7/09

Fingerprint

Seed
Servers
Approximation algorithms
Dynamic programming
Computational complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Mokhtarian, K., & Hefeeda, M. (2009). Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos. In IEEE International Workshop on Quality of Service, IWQoS [5201417] https://doi.org/10.1109/IWQoS.2009.5201417

Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos. / Mokhtarian, Kianoosh; Hefeeda, Mohamed.

IEEE International Workshop on Quality of Service, IWQoS. 2009. 5201417.

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

Mokhtarian, K & Hefeeda, M 2009, Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos. in IEEE International Workshop on Quality of Service, IWQoS., 5201417, 2009 17th International Workshop on Quality of Service, IWQoS 2009, Charleston, SC, United States, 13/7/09. https://doi.org/10.1109/IWQoS.2009.5201417
Mokhtarian K, Hefeeda M. Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos. In IEEE International Workshop on Quality of Service, IWQoS. 2009. 5201417 https://doi.org/10.1109/IWQoS.2009.5201417
Mokhtarian, Kianoosh ; Hefeeda, Mohamed. / Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos. IEEE International Workshop on Quality of Service, IWQoS. 2009.
@inproceedings{b3a3ad13293e4b72afb32e7cd613fe70,
title = "Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos",
abstract = "We study streaming of scalable videos over peer-topeer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity.We formulate the problem of allocating this capacity for optimally serving scalable videos. We show that this problem is NP-complete, and propose two approximation algorithms to solve it. The first one allocates seeding resources for serving peers based on dynamic programming, and is more suitable for small seeding capacities (≤ 10 Mbps). The second algorithm follows a greedy approach and is more efficient for larger capacities. We evaluate the proposed algorithms analytically and in a simulated P2P streaming system. The results confirm the efficiency and near-optimality of the proposed algorithms, and show that higher-quality videos are delivered to peers if our algorithms are employed for allocating seed servers.",
author = "Kianoosh Mokhtarian and Mohamed Hefeeda",
year = "2009",
month = "11",
day = "20",
doi = "10.1109/IWQoS.2009.5201417",
language = "English",
isbn = "9781424438761",
booktitle = "IEEE International Workshop on Quality of Service, IWQoS",

}

TY - GEN

T1 - Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos

AU - Mokhtarian, Kianoosh

AU - Hefeeda, Mohamed

PY - 2009/11/20

Y1 - 2009/11/20

N2 - We study streaming of scalable videos over peer-topeer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity.We formulate the problem of allocating this capacity for optimally serving scalable videos. We show that this problem is NP-complete, and propose two approximation algorithms to solve it. The first one allocates seeding resources for serving peers based on dynamic programming, and is more suitable for small seeding capacities (≤ 10 Mbps). The second algorithm follows a greedy approach and is more efficient for larger capacities. We evaluate the proposed algorithms analytically and in a simulated P2P streaming system. The results confirm the efficiency and near-optimality of the proposed algorithms, and show that higher-quality videos are delivered to peers if our algorithms are employed for allocating seed servers.

AB - We study streaming of scalable videos over peer-topeer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity.We formulate the problem of allocating this capacity for optimally serving scalable videos. We show that this problem is NP-complete, and propose two approximation algorithms to solve it. The first one allocates seeding resources for serving peers based on dynamic programming, and is more suitable for small seeding capacities (≤ 10 Mbps). The second algorithm follows a greedy approach and is more efficient for larger capacities. We evaluate the proposed algorithms analytically and in a simulated P2P streaming system. The results confirm the efficiency and near-optimality of the proposed algorithms, and show that higher-quality videos are delivered to peers if our algorithms are employed for allocating seed servers.

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

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

U2 - 10.1109/IWQoS.2009.5201417

DO - 10.1109/IWQoS.2009.5201417

M3 - Conference contribution

SN - 9781424438761

BT - IEEE International Workshop on Quality of Service, IWQoS

ER -