Optimal bandwidth sharing in multiswarm multiparty p2p video-conferencing systems

Chao Liang, Miao Zhao, Yong Liu

Research output: Contribution to journalArticle

Abstract

In a multiparty video conference, multiple users simultaneously distribute video streams to their receivers. As the traditional server-based solutions incur high infrastructure and bandwidth cost, conventional peer-to-peer (P2P) solutions only leveraging end-users' upload bandwidth are normally not self-sustainable: The video streaming workload increases quadratically with the number of users as each user could generate and distribute video streams, while the user upload bandwidth only increases linearly. Recently, hybrid solutions have been proposed that employ helpers to address the bandwidth deficiency in P2P video-conferencing swarms. It is also noticed that a system hosting multiple parallel conferencing swarms can benefit from cross-swarm bandwidth sharing. However, how to optimally share bandwidth in such systems has not been explored so far. In this paper, we study the optimal bandwidth sharing in multiswarm multiparty P2P video-conferencing systems with helpers and investigate two cross-swarm bandwidth-sharing scenarios: 1) swarms are independent and peers from different swarms share a common pool of helpers; 2) swarms are cooperative and peers in a bandwidth-rich swarm can further share their bandwidth with peers in a bandwidth-poor swarm. For each scenario, we develop distributed algorithms for intraswarm and interswarm bandwidth allocation under a utility-maximization framework. Through analysis and simulation, we show that the proposed algorithms are robust to peer dynamics and can adaptively allocate peer and helper bandwidth across swarms so as to achieve the system-wide optimum.

Original languageEnglish (US)
Article number5754627
Pages (from-to)1704-1716
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume19
Issue number6
DOIs
StatePublished - Dec 2011

Fingerprint

Video conferencing
Bandwidth
Frequency allocation
Video streaming
Parallel algorithms
Servers

Keywords

  • Conferencing
  • distributed algorithms
  • optimal bandwidth sharing
  • peer-to-peer (P2P)
  • scheduling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Optimal bandwidth sharing in multiswarm multiparty p2p video-conferencing systems. / Liang, Chao; Zhao, Miao; Liu, Yong.

In: IEEE/ACM Transactions on Networking, Vol. 19, No. 6, 5754627, 12.2011, p. 1704-1716.

Research output: Contribution to journalArticle

@article{3fed4dc0640748418b1ecef454c11ca2,
title = "Optimal bandwidth sharing in multiswarm multiparty p2p video-conferencing systems",
abstract = "In a multiparty video conference, multiple users simultaneously distribute video streams to their receivers. As the traditional server-based solutions incur high infrastructure and bandwidth cost, conventional peer-to-peer (P2P) solutions only leveraging end-users' upload bandwidth are normally not self-sustainable: The video streaming workload increases quadratically with the number of users as each user could generate and distribute video streams, while the user upload bandwidth only increases linearly. Recently, hybrid solutions have been proposed that employ helpers to address the bandwidth deficiency in P2P video-conferencing swarms. It is also noticed that a system hosting multiple parallel conferencing swarms can benefit from cross-swarm bandwidth sharing. However, how to optimally share bandwidth in such systems has not been explored so far. In this paper, we study the optimal bandwidth sharing in multiswarm multiparty P2P video-conferencing systems with helpers and investigate two cross-swarm bandwidth-sharing scenarios: 1) swarms are independent and peers from different swarms share a common pool of helpers; 2) swarms are cooperative and peers in a bandwidth-rich swarm can further share their bandwidth with peers in a bandwidth-poor swarm. For each scenario, we develop distributed algorithms for intraswarm and interswarm bandwidth allocation under a utility-maximization framework. Through analysis and simulation, we show that the proposed algorithms are robust to peer dynamics and can adaptively allocate peer and helper bandwidth across swarms so as to achieve the system-wide optimum.",
keywords = "Conferencing, distributed algorithms, optimal bandwidth sharing, peer-to-peer (P2P), scheduling",
author = "Chao Liang and Miao Zhao and Yong Liu",
year = "2011",
month = "12",
doi = "10.1109/TNET.2011.2141680",
language = "English (US)",
volume = "19",
pages = "1704--1716",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Optimal bandwidth sharing in multiswarm multiparty p2p video-conferencing systems

AU - Liang, Chao

AU - Zhao, Miao

AU - Liu, Yong

PY - 2011/12

Y1 - 2011/12

N2 - In a multiparty video conference, multiple users simultaneously distribute video streams to their receivers. As the traditional server-based solutions incur high infrastructure and bandwidth cost, conventional peer-to-peer (P2P) solutions only leveraging end-users' upload bandwidth are normally not self-sustainable: The video streaming workload increases quadratically with the number of users as each user could generate and distribute video streams, while the user upload bandwidth only increases linearly. Recently, hybrid solutions have been proposed that employ helpers to address the bandwidth deficiency in P2P video-conferencing swarms. It is also noticed that a system hosting multiple parallel conferencing swarms can benefit from cross-swarm bandwidth sharing. However, how to optimally share bandwidth in such systems has not been explored so far. In this paper, we study the optimal bandwidth sharing in multiswarm multiparty P2P video-conferencing systems with helpers and investigate two cross-swarm bandwidth-sharing scenarios: 1) swarms are independent and peers from different swarms share a common pool of helpers; 2) swarms are cooperative and peers in a bandwidth-rich swarm can further share their bandwidth with peers in a bandwidth-poor swarm. For each scenario, we develop distributed algorithms for intraswarm and interswarm bandwidth allocation under a utility-maximization framework. Through analysis and simulation, we show that the proposed algorithms are robust to peer dynamics and can adaptively allocate peer and helper bandwidth across swarms so as to achieve the system-wide optimum.

AB - In a multiparty video conference, multiple users simultaneously distribute video streams to their receivers. As the traditional server-based solutions incur high infrastructure and bandwidth cost, conventional peer-to-peer (P2P) solutions only leveraging end-users' upload bandwidth are normally not self-sustainable: The video streaming workload increases quadratically with the number of users as each user could generate and distribute video streams, while the user upload bandwidth only increases linearly. Recently, hybrid solutions have been proposed that employ helpers to address the bandwidth deficiency in P2P video-conferencing swarms. It is also noticed that a system hosting multiple parallel conferencing swarms can benefit from cross-swarm bandwidth sharing. However, how to optimally share bandwidth in such systems has not been explored so far. In this paper, we study the optimal bandwidth sharing in multiswarm multiparty P2P video-conferencing systems with helpers and investigate two cross-swarm bandwidth-sharing scenarios: 1) swarms are independent and peers from different swarms share a common pool of helpers; 2) swarms are cooperative and peers in a bandwidth-rich swarm can further share their bandwidth with peers in a bandwidth-poor swarm. For each scenario, we develop distributed algorithms for intraswarm and interswarm bandwidth allocation under a utility-maximization framework. Through analysis and simulation, we show that the proposed algorithms are robust to peer dynamics and can adaptively allocate peer and helper bandwidth across swarms so as to achieve the system-wide optimum.

KW - Conferencing

KW - distributed algorithms

KW - optimal bandwidth sharing

KW - peer-to-peer (P2P)

KW - scheduling

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

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

U2 - 10.1109/TNET.2011.2141680

DO - 10.1109/TNET.2011.2141680

M3 - Article

VL - 19

SP - 1704

EP - 1716

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 6

M1 - 5754627

ER -