Randomized Decentralized Broadcasting Algorithms Export

@inproceedings{citeulike:2886499, abstract = {We consider the problem of broadcasting a live stream of data in an unstructured network. The broadcasting problem has been studied extensively for edge-capacitated networks. We give the first proof that whenever demand lambda + epsiv is feasible for epsiv \> 0, a simple local-control algorithm is stable under demand lambda, and as a corollary a famous theorem of Edmonds. We then study the node-capacitated case and show a similar optimality result for the complete graph. We study through simulation the delay that users must wait in order to playback a video stream with a small number of skipped packets, and discuss the suitability of our algorithms for live video streaming.}, author = {Massoulie, L. and Twigg, A. and Gkantsidis, C. and Rodriguez, P.}, booktitle = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE}, citeulike-article-id = {2886499}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/INFCOM.2007.129}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4215711}, doi = {10.1109/INFCOM.2007.129}, journal = {INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE}, keywords = {broadcasting, project-p2p-theory, randomization}, pages = {1073--1081}, posted-at = {2008-09-30 23:03:43}, priority = {0}, title = {Randomized Decentralized Broadcasting Algorithms}, url = {http://dx.doi.org/10.1109/INFCOM.2007.129}, year = {2007} }

TY - CONF ID - citeulike:2886499 L3 - citeulike-article-id:2886499 N2 - We consider the problem of broadcasting a live stream of data in an unstructured network. The broadcasting problem has been studied extensively for edge-capacitated networks. We give the first proof that whenever demand lambda + epsiv is feasible for epsiv > 0, a simple local-control algorithm is stable under demand lambda, and as a corollary a famous theorem of Edmonds. We then study the node-capacitated case and show a similar optimality result for the complete graph. We study through simulation the delay that users must wait in order to playback a video stream with a small number of skipped packets, and discuss the suitability of our algorithms for live video streaming. JF - INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE EP - 1081 TI - Randomized Decentralized Broadcasting Algorithms T2 - INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE SP - 1073 KW - broadcasting KW - project-p2p-theory KW - randomization AU - Massoulie, L AU - Twigg, A AU - Gkantsidis, C AU - Rodriguez, P PY - 2007/// UR - http://dx.doi.org/10.1109/INFCOM.2007.129 ER -