Deterministic near-optimal P2P streaming

Shaileshh Bojja Venkatakrishnan, Pramod Viswanath

Research output: Contribution to journalConference article

Abstract

We consider live-streaming over a peer-to-peer network in which peers are allowed to enter or leave the system adversarially and arbitrarily. Previous approaches for streaming have either used randomized distribution graphs or structured trees with randomized maintenance algorithms. Randomized graphs handle peer churn well but have only probabilistic connectivity guarantees, while structured trees have good connectivity but have proven hard to maintain under peer churn. We improve upon both approaches by presenting a novel distribution structure with a deterministic and distributed algorithm for maintenance under peer churn. The algorithm has a constant repair time for connectivity, and near optimal delay. As opposed to order results, the guarantees provided by our algorithm are exact and hold for any network size.

Original languageEnglish (US)
Pages (from-to)451-452
Number of pages2
JournalPerformance Evaluation Review
Volume43
Issue number1
DOIs
StatePublished - Jun 24 2015
EventACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2015 - Portland, United States
Duration: Jun 15 2015Jun 19 2015

Fingerprint

Peer to peer networks
Parallel algorithms
Repair

Keywords

  • Deterministic
  • One-to-many content distribution
  • Peer-to-peer
  • Streaming

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Deterministic near-optimal P2P streaming. / Venkatakrishnan, Shaileshh Bojja; Viswanath, Pramod.

In: Performance Evaluation Review, Vol. 43, No. 1, 24.06.2015, p. 451-452.

Research output: Contribution to journalConference article

Venkatakrishnan, Shaileshh Bojja ; Viswanath, Pramod. / Deterministic near-optimal P2P streaming. In: Performance Evaluation Review. 2015 ; Vol. 43, No. 1. pp. 451-452.
@article{455afba0ec9d47be927456b1dea6d431,
title = "Deterministic near-optimal P2P streaming",
abstract = "We consider live-streaming over a peer-to-peer network in which peers are allowed to enter or leave the system adversarially and arbitrarily. Previous approaches for streaming have either used randomized distribution graphs or structured trees with randomized maintenance algorithms. Randomized graphs handle peer churn well but have only probabilistic connectivity guarantees, while structured trees have good connectivity but have proven hard to maintain under peer churn. We improve upon both approaches by presenting a novel distribution structure with a deterministic and distributed algorithm for maintenance under peer churn. The algorithm has a constant repair time for connectivity, and near optimal delay. As opposed to order results, the guarantees provided by our algorithm are exact and hold for any network size.",
keywords = "Deterministic, One-to-many content distribution, Peer-to-peer, Streaming",
author = "Venkatakrishnan, {Shaileshh Bojja} and Pramod Viswanath",
year = "2015",
month = "6",
day = "24",
doi = "10.1145/2745844.2745888",
language = "English (US)",
volume = "43",
pages = "451--452",
journal = "Performance Evaluation Review",
issn = "0163-5999",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - Deterministic near-optimal P2P streaming

AU - Venkatakrishnan, Shaileshh Bojja

AU - Viswanath, Pramod

PY - 2015/6/24

Y1 - 2015/6/24

N2 - We consider live-streaming over a peer-to-peer network in which peers are allowed to enter or leave the system adversarially and arbitrarily. Previous approaches for streaming have either used randomized distribution graphs or structured trees with randomized maintenance algorithms. Randomized graphs handle peer churn well but have only probabilistic connectivity guarantees, while structured trees have good connectivity but have proven hard to maintain under peer churn. We improve upon both approaches by presenting a novel distribution structure with a deterministic and distributed algorithm for maintenance under peer churn. The algorithm has a constant repair time for connectivity, and near optimal delay. As opposed to order results, the guarantees provided by our algorithm are exact and hold for any network size.

AB - We consider live-streaming over a peer-to-peer network in which peers are allowed to enter or leave the system adversarially and arbitrarily. Previous approaches for streaming have either used randomized distribution graphs or structured trees with randomized maintenance algorithms. Randomized graphs handle peer churn well but have only probabilistic connectivity guarantees, while structured trees have good connectivity but have proven hard to maintain under peer churn. We improve upon both approaches by presenting a novel distribution structure with a deterministic and distributed algorithm for maintenance under peer churn. The algorithm has a constant repair time for connectivity, and near optimal delay. As opposed to order results, the guarantees provided by our algorithm are exact and hold for any network size.

KW - Deterministic

KW - One-to-many content distribution

KW - Peer-to-peer

KW - Streaming

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

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

U2 - 10.1145/2745844.2745888

DO - 10.1145/2745844.2745888

M3 - Conference article

AN - SCOPUS:84955618264

VL - 43

SP - 451

EP - 452

JO - Performance Evaluation Review

JF - Performance Evaluation Review

SN - 0163-5999

IS - 1

ER -