A digital fountain approach to asynchronous reliable multicast Export

@article{Byers-2002-DigitalFountain, abstract = {The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system.}, author = {Byers, J. W. and Luby, M. and Mitzenmacher, M.}, citeulike-article-id = {876280}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/JSAC.2002.803996}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1038582}, doi = {10.1109/JSAC.2002.803996}, journal = {Selected Areas in Communications, IEEE Journal on}, keywords = {application, codes, erasure, information, system, theory}, number = {8}, pages = {1528--1540}, posted-at = {2009-03-26 23:14:34}, priority = {2}, title = {A digital fountain approach to asynchronous reliable multicast}, url = {http://dx.doi.org/10.1109/JSAC.2002.803996}, volume = {20}, year = {2002} }

TY - JOUR ID - Byers-2002-DigitalFountain L3 - citeulike-article-id:876280 N2 - The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system. IS - 8 JF - Selected Areas in Communications, IEEE Journal on EP - 1540 TI - A digital fountain approach to asynchronous reliable multicast VL - 20 SP - 1528 KW - application KW - codes KW - erasure KW - information KW - system KW - theory AU - Byers, JW AU - Luby, M AU - Mitzenmacher, M PY - 2002/// UR - http://dx.doi.org/10.1109/JSAC.2002.803996 ER -