Delay Asymptotics and Scalability for Peer-to-Peer Live Streaming

Abstract

Abstract-A large number of peer-to-peer streaming systems has been proposed and deployed in recent years. Yet, there is no clear understanding of how these systems scale and how multi-path and multihop transmission, properties of all recent systems, affect the quality experienced by the peers. In this paper we present an analytical study that considers the relationship between delay and loss for general overlays: we study the tradeoff between the playback delay and the probability of missing a packet and we derive bounds on the scalability of the systems. We present an exact model of push-based overlays and show that the bounds hold under diverse conditions: in the presence of errors, under node churn, and when using forward error correction and various retransmission schemes.

Scalable Distributed Communication Architectures to Support Advanced Metering Infrastructure in Smart Grid

“…With multiple data sources exploited, desirable performance can be achieved at each user node although the processing ability and communication bandwidth at each node are limited. Due to the need to exploit a huge number of nodes to provide an ideal service, the process to locate the source of contents could be very costly and an inappropriate design may cause serious scalability problems [16], [17], [18].…”

Achieving the Optimal Steaming Capacity and Delay Using Random Regular Digraphs in P2P Networks

“…for sufficiently large N . Note that if we take < , the term in the bracket in (23) is upper bounded by e −1 for sufficiently large N . Hence, if A l is true for all l ≤ h 1 , then S >h1 ≤ N/ exp(log 1−c N ), which implies one of B 1 , B 2 , • • • , B h * is true for large N .…”