TY - GEN
T1 - An optimal topology for a static P2P live streaming network with limited resources
AU - Stern, Jonathan
AU - Luzzatti, Omer
AU - Goldberg, Raphael
AU - Weiss, Eran
AU - Gonen, Mira
PY - 2011
Y1 - 2011
N2 - In this paper we propose a P2P live streaming topology, prove its optimality under common constraints, and match the analytical research with results from a running commercial network. We assume two types of nodes: viewers that consume the entire media, and amplifiers which are non-viewing nodes utilized for their upstream bandwidth. We analytically derive the minimum needed server upload capacity, for any topology, under the following assumptions: the amount of amplifiers and buffer time are limited, dynamics are low, and the total bandwidth required by the viewers exceeds the total upstream bandwidth of all peers. Then, we present a twolevel topology and prove that it achieves the minimum possible server upload, up to a small fraction. Finally, the assumptions and derivation are supported by performing several experiments on RayV's real-world commercial system, with varying network parameters. Namely, we show our predictions are valid while varying the viewers to amplifiers ratio, the stream bitrate, and the country of the peers. These results not only verify the analytical static predictions, but also evaluate the dynamic costs during the'flash crowd', the initial time when peers are joining the system.
AB - In this paper we propose a P2P live streaming topology, prove its optimality under common constraints, and match the analytical research with results from a running commercial network. We assume two types of nodes: viewers that consume the entire media, and amplifiers which are non-viewing nodes utilized for their upstream bandwidth. We analytically derive the minimum needed server upload capacity, for any topology, under the following assumptions: the amount of amplifiers and buffer time are limited, dynamics are low, and the total bandwidth required by the viewers exceeds the total upstream bandwidth of all peers. Then, we present a twolevel topology and prove that it achieves the minimum possible server upload, up to a small fraction. Finally, the assumptions and derivation are supported by performing several experiments on RayV's real-world commercial system, with varying network parameters. Namely, we show our predictions are valid while varying the viewers to amplifiers ratio, the stream bitrate, and the country of the peers. These results not only verify the analytical static predictions, but also evaluate the dynamic costs during the'flash crowd', the initial time when peers are joining the system.
UR - http://www.scopus.com/inward/record.url?scp=84856591846&partnerID=8YFLogxK
U2 - 10.1109/ICPADS.2011.27
DO - 10.1109/ICPADS.2011.27
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84856591846
SN - 9780769545769
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 729
EP - 734
BT - Proceedings - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011
T2 - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011
Y2 - 7 December 2011 through 9 December 2011
ER -