John W. Byers
Michael Luby
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.
- 1.S. Acharya, M. Franklin, and S. Zdonik, "Dissemination Based Data Delivery Using Broadcast Disks," IEEE Personal Communications, December 1995, pp. 50-60.Google Scholar
Cross Ref
- 2.A. Bestavros. "AIDA-based real-time fault-tolerant broadcast disks." In Procedings o/the 16th IEEE Real- Time System Symposium, 1996. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- 5.S. Floyd, V. Jacobson, C. G. Liu, S. McCanne, and L. Zhang, "A Rehable Multicast Framework for Light- Weight Sessions and Apphcation Level Framing." In ACM SIGCOMM '95, pp. 342-356, August 1995. Google ScholarDigital Library
- 6.J. Gemmell, "ECSRM- Erasure Correcting Scalable Reliable Multicast," Microsoft Research Technical Report MS- TR-97-20, June 1997.Google Scholar
- 7.C. Huitema, "The Case for Packet Level FEC.' In Proc. o/IFIP 5th Int'l Workshop on Protocols/or High Speed Networks, Sophia Antipolis, France, October 1996. Google ScholarDigital Library
- 8.Cauchy-based Reed-Solomon codes. Available at http://~w~, icsi. berkeley, edu/~ luby.Google Scholar
- 9.V. Jacobson, "pathchar", available at ht tp://www-mrg, ee. lbl. gov/pathchar.Google Scholar
- 10.J. C. Lin and S. Paul, "RMTP: A Reliable Multicast Transport Protocol." In iEEE INFOCOM '96, pp. 1414-1424, March 1996. Google ScholarDigital Library
- 11.M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann, "Practical Loss-Resilient Codes." In Proceedings o/the 29th A CM Symposium on Theory o/Computing, 1997. Google ScholarDigital Library
- 12.M. Luby, M. Mitzenmacher, and A. Shokrollahi, "Analysis of Random Processes via And-Or Tree Evaluation." In Proceedings o/the 9th Annual A CM-SIAM Symposium on Discrete Algorithms, January 1998. Google ScholarDigital Library
- 13.N. F. Maxemchuk, Dispersity Routing in Store and Forward Networks. Ph.D. thesis, University of Pennsylvania, May 1975.Google Scholar
- 14.N. F. Maxemchuk, "Dispersity Routing." Proceedings of ICC '75, San Francisco, CA, pp. 41-10- 41-13, 1975.Google Scholar
- 15.S. McCanne, V. Jacobson, and M. Vetterli, "Receiverdriven Layered Multicast." in Proc. o/ A CM SIG- COMM '96, pp. 117-130, 1996. Google ScholarDigital Library
- 16.C. K. Miller, "Reliable Multicast Protocols: A Practical View." In Proc. o/the ~~nd Annual Con/erence on Local Computer Networks (LCN '97), 1997. Google ScholarDigital Library
- 17.J. Nonnenmacher and E. W. Biersack, "Reliable Multicast: Where to Use Forward Error Correction." In Proc. o/IFIP 5th Int'l Workshop on Protocols/or High Speed Networks, pp. 134-148, Sophia Antipolis, France, October 1996. Chapman and Hall. Google ScholarDigital Library
- 18.J. Nonnenmacher and E.W. Biersack, "Asynchronous Multicast Push: AMP." In Proc. o/International Conference on Computer Communications, Cannes, France, November 1997.Google Scholar
- 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.Google Scholar
- 20.J. Nonnenmacher, E. W. Biersack, and D. Towsley, "Parity-Based Loss Recovery for Reliable Multicast Transmission." In Proc. o/ACM SIGCOMM '97, 1997. Google ScholarDigital Library
- 21.M. O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance." In Journal o/the A CM, Volume 38, pp. 335-348, 1989. Google ScholarDigital Library
- 22.L. Rizzo, "Effective Erasure Codes for Reliable Computer Communication Protocols." In Computer Communication Review, April 1997. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 27.R. Yavatkar, J. Griffoen and M. Sudan, "A Reliable Dis~ semination Protocol for Interactive Collaborative Applications.'' in Proceedings of A CM Multimedia '95, San Francisco, 1995, pp. 333-344. Google ScholarDigital Library
Index Terms
- A digital fountain approach to reliable distribution of bulk data
Recommendations
A digital fountain approach to reliable distribution of bulk data
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 ...
Fountain codes over fading relay channels
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes, fountain codes are capable of adapting the bit rate to the channel realization blindly, i.e., without channel information at the ...
Trapping sets of fountain codes
The remarkable results of Fountain codes over the binary erasure channel (BEC) have motivated research on their practical implementation over noisy channels. Trapping sets are a phenomenon of great practical importance for certain graph codes on noisy ...
Comments