P2P streaming capacity under node degree bound

Shao Liu, Minghua Chen, Sudipta Sengupta, Mung Chiang, Jin Li, Phil A. Chou

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

40 Scopus citations

Abstract

Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algorithms can achieve close to this maximum? These problems of computing and approaching the P2P streaming capacity are often challenging because of the constraints imposed on overlay topology. In this paper, we focus on the limit of P2P streaming rate under node degree bound, i.e., the number of connections a node can maintain is upper bounded. We first show that the streaming capacity problem under node degree bound is NP-Complete in general. Then, for the case of node out-degree bound, through the construction of a "Bubble algorithm", we show that the streaming capacity is at least half of that of a much less restrictive and previously studied case, where we bound the node degree in each streaming tree but not the degree across all trees. Then, for the case of node total-degree bound, we develop a "Cluster-Tree algorithm" that provides a probabilistic guarantee of achieving a rate close to the maximum rate achieved under no degree bound constraint, when the node degree bound is logarithmic in network size. The effectiveness of these algorithms in approaching the capacity limit is demonstrated in simulations using uplink bandwidth statistics of Internet hosts. Both analysis and numerical experiments show that peering in a locally dense and globally sparse manner achieves near-optimal streaming rate if the degree bound is at least logarithmic in network size.

Original languageEnglish (US)
Title of host publicationICDCS 2010 - 2010 International Conference on Distributed Computing Systems
Pages587-598
Number of pages12
DOIs
StatePublished - Aug 27 2010
Event30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010 - Genova, Italy
Duration: Jun 21 2010Jun 25 2010

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

Other30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010
CountryItaly
CityGenova
Period6/21/106/25/10

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'P2P streaming capacity under node degree bound'. Together they form a unique fingerprint.

  • Cite this

    Liu, S., Chen, M., Sengupta, S., Chiang, M., Li, J., & Chou, P. A. (2010). P2P streaming capacity under node degree bound. In ICDCS 2010 - 2010 International Conference on Distributed Computing Systems (pp. 587-598). [5541689] (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2010.39