A Digital Fountain Approach to Reliable Distribution of Bulk Data (1998)
Cached
Download Links
- [www.cs.ucsb.edu]
- [www-cse.ucsd.edu]
- [ramp.ucsd.edu]
- [www.stanford.edu]
- [www.cs.rutgers.edu]
- [www.ecse.rpi.edu]
- [ftp.digital.com]
- [www.cs.wisc.edu]
- [www.cs.bu.edu]
- [ftp.icsi.berkeley.edu]
- [www.research.digital.com]
- [ftp.icsi.berkeley.edu]
- [gatekeeper.research.compaq.com]
- [www.eecs.harvard.edu]
- [www.hpl.hp.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of ACM SIGCOMM ’98 |
| Citations: | 322 - 14 self |
BibTeX
@INPROCEEDINGS{Byers98adigital,
author = {John W. Byers and Michael Lubyt and Michael Mitzenmacher and Ashutosh Rege},
title = {A Digital Fountain Approach to Reliable Distribution of Bulk Data},
booktitle = {In Proc. of ACM SIGCOMM ’98},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 prot.ocols. 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. 1
