ACM Home Page
Please provide us with feedback. Feedback
A digital fountain approach to reliable distribution of bulk data
Full text PdfPdf (1.65 MB)
Source Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication table of contents
Vancouver, British Columbia, Canada
Pages: 56 - 67  
Year of Publication: 1998
ISBN:1-58113-003-1
Also published in ...
Authors
John W. Byers  UC Berkeley and International Computer Science Institute, Berkeley, California
Michael Luby  International Computer Science Institute, Berkeley, California
Michael Mitzenmacher  Digital Systems Research Center, Palo Alto, California
Ashutosh Rege  International Computer Science Institute, Berkeley, California
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 78,   Downloads (12 Months): 280,   Citation Count: 94
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/285237.285258
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Acharya, M. Franklin, and S. Zdonik, "Dissemination Based Data Delivery Using Broadcast Disks," IEEE Personal Communications, December 1995, pp. 50-60.
 
2
A. Bestavros. "AIDA-based real-time fault-tolerant broadcast disks." In Procedings o/the 16th IEEE Real- Time System Symposium, 1996.
 
3
S. Bhattacharyya, J. F. Kurose, D. Towsley, and R. Nagarajan, "Efficient Rate-Controlled Bulk Data Transfer using Multiple Multicast Groups", In Proc. of INFO- COM '98, San Francisco, April 1998.
 
4
.I. B15mer, M. Kalfane, M. Karpinski, R. Karp, M. Luby, and D. Zuckerman, "An XOR-Based Erasure- Resilient Coding Scheme," ICSI Technical Report No. TR-95-O~i8, August 1995.
5
 
6
J. Gemmell, "ECSRM- Erasure Correcting Scalable Reliable Multicast," Microsoft Research Technical Report MS- TR-97-20, June 1997.
 
7
 
8
Cauchy-based Reed-Solomon codes. Available at http://~w~, icsi. berkeley, edu/~ luby.
 
9
V. Jacobson, "pathchar", available at ht tp://www-mrg, ee. lbl. gov/pathchar.
 
10
J. C. Lin and S. Paul, "RMTP: A Reliable Multicast Transport Protocol." In iEEE INFOCOM '96, pp. 1414-1424, March 1996.
11
 
12
 
13
N. F. Maxemchuk, Dispersity Routing in Store and Forward Networks. Ph.D. thesis, University of Pennsylvania, May 1975.
 
14
N. F. Maxemchuk, "Dispersity Routing." Proceedings of ICC '75, San Francisco, CA, pp. 41-10- 41-13, 1975.
15
 
16
 
17
 
18
J. Nonnenmacher and E.W. Biersack, "Asynchronous Multicast Push: AMP." In Proc. o/International Conference on Computer Communications, Cannes, France, November 1997.
 
19
J. Nonnenmacher, M. Lacher, M. Jung, G. Carl, and E.W. Biersack, "How Bad is Reliable Multicast Without Local Recovery?" In Proc. o/iNFOCOM '98, San Francisco, April 1998.
20
21
22
 
23
L. Rizzo and L. Vicisano, "A Reliable Multicast data Distribution Protocol Based on Software FEC Techniques.'' In Proc. of HPCS '97, Greece, June 1997.
 
24
E. Schooler and J. Gemmell, "Using multicast FEC to solve the midnight madness problem," Microsoft Research Technical Report MS-TR-97-~5, September 1997.
 
25
L. Vicisano, L. Rizzo, and J. Crowcroft. "TCP-like congestion control for layered multicast data transfer." in Proc. of INFOCOM '98, San Francisco, April 1998.
 
26
M. Yajnik, J. Kurose, and D. Towsley, "Packet Loss Correlation in the MBone Multicast Network." In Proceedings of IEEE Global Internet '96, London, November 1996.
27

CITED BY  94

Collaborative Colleagues:
John W. Byers: colleagues
Michael Luby: colleagues
Michael Mitzenmacher: colleagues
Ashutosh Rege: colleagues