Rate-optimal schemes for Peer-to-Peer live streaming Export

@article{citeulike:3191078, abstract = {In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several network models and for each model we identify schemes that achieve successful diffusion of data at optimal rates. For edge-capacitated networks, we show optimality of the so-called "random-useful" packet forwarding algorithm. As a byproduct, we obtain a novel proof of a famous theorem of Edmonds, characterising the broadcast capacity of a capacitated graph. For node-capacitated networks, assuming a complete communication graph, we show optimality of the so-called "most-deprived" neighbour selection scheme combined with random useful packet selection. We then show that optimality is preserved when each peer can exchange data with a limited number of neighbours, when neighbourhoods are dynamically adapted according to a particular scheme. Finally, we consider the case of multiple information sources, each creating distinct information to be disseminated to a specific set of receivers. In this context, we prove optimality of the so-called "bundled most-deprived neighbour random useful packet" selection.}, author = {Massoulie, Laurent and Twigg, Andrew}, citeulike-article-id = {3191078}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.peva.2008.03.003}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V13-4S7BD9K-1/2/052bac94ce7b378cfb41cb41960fd53d}, doi = {10.1016/j.peva.2008.03.003}, journal = {Performance Evaluation}, keywords = {gossip, p2p, project-p2p-theory, streaming}, posted-at = {2008-09-04 11:12:05}, priority = {0}, title = {Rate-optimal schemes for Peer-to-Peer live streaming}, url = {http://dx.doi.org/10.1016/j.peva.2008.03.003}, volume = {In Press, Corrected Proof} }

TY - JOUR ID - citeulike:3191078 L3 - citeulike-article-id:3191078 N2 - In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several network models and for each model we identify schemes that achieve successful diffusion of data at optimal rates. For edge-capacitated networks, we show optimality of the so-called "random-useful" packet forwarding algorithm. As a byproduct, we obtain a novel proof of a famous theorem of Edmonds, characterising the broadcast capacity of a capacitated graph. For node-capacitated networks, assuming a complete communication graph, we show optimality of the so-called "most-deprived" neighbour selection scheme combined with random useful packet selection. We then show that optimality is preserved when each peer can exchange data with a limited number of neighbours, when neighbourhoods are dynamically adapted according to a particular scheme. Finally, we consider the case of multiple information sources, each creating distinct information to be disseminated to a specific set of receivers. In this context, we prove optimality of the so-called "bundled most-deprived neighbour random useful packet" selection. JF - Performance Evaluation TI - Rate-optimal schemes for Peer-to-Peer live streaming VL - In Press, Corrected Proof KW - gossip KW - p2p KW - project-p2p-theory KW - streaming AU - Massoulie, Laurent AU - Twigg, Andrew UR - http://dx.doi.org/10.1016/j.peva.2008.03.003 ER -