Optimizing P2P streaming throughput under peer churning |
| |
Authors: | Yi Cui Yanchuan Cao Liang Dai Yuan Xue |
| |
Affiliation: | (1) Department of Electrical Engineering and Computer Science, Vanderbilt University, Nashville, TN 37235, USA |
| |
Abstract: | High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s)
of streaming. Although this problem has been thoroughly investigated in the classical optimization framework under static
settings, it still remains unaddressed as how to sustain throughput competitive to the optimum under highly dynamic peer churning.
To accommodate such peer dynamics, we extend the classical optimization framework and propose a distributed online peer selection
algorithm. This basic algorithm is further extended to a variety of settings commonly seen in operational P2P networks, such
as multi-parent streaming, admission control, delay constraint, etc. We prove approximation bound of our algorithm to the
optimal throughput. Through evaluation under different topological setups and peer churning sequences, we show that our solution
can consistently deliver competitive throughput, which greatly outperforms its theoretical bound.
This work was supported by NSF award 0643488, Vanderbilt Discovery grant, and a gift from Microsoft Research. Views and conclusions
of this paper are those of authors, which should not be interpreted as representing the official policies, either expressed
or implied, of the funding agencies. |
| |
Keywords: | Peer-to-peer Streaming Optimization Online algorithm Routing |
本文献已被 SpringerLink 等数据库收录! |
|