Name
Abstract | ||
|---|---|---|
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.
|
Year | DOI | Venue |
|---|---|---|
1998 | 10.1145/285237.285258 | Special Interest Group on Data Communication |
Keywords | Field | DocType |
erasure code,performance measurement,digital fountain approach,new class,large number,scalable protocol,reliable distribution,new multicast,large block size,bulk data,digital fountain,broadcast protocol,scheduling,sharing | Broadcasting,Luby transform code,Computer science,Fountain code,Computer network,Communication channel,Multicast,Erasure code,Soliton distribution,Distributed computing,Scalability | Conference |
Volume | Issue | ISSN |
28 | 4 | 0146-4833 |
ISBN | Citations | PageRank |
1-58113-003-1 | 562 | 65.92 |
References | Authors | |
18 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John W. Byers | 1 | 562 | 65.92 |
| Michael Luby | 2 | 9010 | 1319.35 |
| Michael Mitzenmacher | 3 | 7386 | 730.89 |
| Ashutosh Rege | 4 | 622 | 73.93 |