The feasibility of supporting large-scale live streaming applications with dynamic application end-points

Abstract

While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is little known about its feasibility for more bandwidth-demanding applications such as live streaming. Heterogeneity in bandwidth resources and dynamic group membership, inherent properties of application end-points, may adversely affect the construction of a usable and efficient overlay. At large scales, the problems become even more challenging. In this paper, we study one of the most prominent architectural issues in overlay multicast: the feasibility of supporting large-scale groups using an application end-point architecture. We look at three key requirements for feasibility: (i) are there enough resources to construct an overlay, (ii) can a stable and connected overlay be maintained in the presence of group dynamics, and (iii) can an efficient overlay be constructed? Using traces from a large content delivery network, we characterize the behavior of users watching live audio and video streams. We show that in many common real-world scenarios, all three requirements are satisfied. In addition, we evaluate the performance of several design alternatives and show that simple algorithms have the potential to meet these requirements in practice. Overall, our results argue for the feasibility of supporting large-scale live streaming using an application end-point architecture.

A Rational Model for Service Rate Allocation in Peer-to-Peer Networks

“…We also plan to modify our mechanism in order to induce topologies different from simple rings, like multicast trees for multimedia streaming in peer-to-peer networks. [11] …”

Maximizing Resilient Throughput in Peer-to-Peer Network

“…Several well-known works, such as Bullet [16], SplitStream [3], and CoopNet [4], also employs the multi-tree approach to reduce the impact of peer failure, meanwhile increasing the aggregate throughput. In contrast to the depth-optimizing approach, Sripanidkulchai et al [5] propose the longest-first algorithm which, by utilizing peers' heavy tailed lifetime distribution, grants the longest lived peer with higher priority. These algorithms coincide with many findings in our paper, such as the optimal tree structure exhibited in the multi-tree setting under star network model.…”

“…While important heuristics have been proposed such as minimizing depth [1,2], multiple trees [3,4], bandwidth-first, age-first [5], or a hybrid of the two [6], some analytical works have tried to analyze and compare their performances under stochastic framework [7,8] or real-system traces. However, this domain has been rarely examined from the optimization perspective.…”

Providing VoD Services Based on Unstructured Overlay

“…Many P2P live streaming systems are fairly successful, such as CoolStreaming [14], AnySee [15], Zigzag [1], ESM [2]. However, it remains an open question whether similar P2P technologies could be used to provide scalable VoD services.…”

“…As illustrated inFigure 2, a peer includes four key modules: (1) Local Streaming Server performs the RTSP protocol interactivity with the upper player, such as DESCRIBE, PLAY, PAUSE and TEARDOWN, and sends 1s content to the player each second (2). …”