作者
John W Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege
发表日期
1998/10/1
期刊
ACM SIGCOMM Computer Communication Review
卷号
28
期号
4
页码范围
56-67
出版商
ACM
简介
The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients 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 clients to acquire bulk data 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 a new class 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.
引用总数
199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320241838547474851219311311298111110881099989984858474034241913
学术搜索中的文章
JW Byers, M Luby, M Mitzenmacher, A Rege - ACM SIGCOMM Computer Communication Review, 1998