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 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]  Nicholas F. Maxemchuk,et al.  DISPERSITY ROUTING IN STORE-AND-FORWARD NETWORKS. , 1975 .

[2]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[3]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[4]  Madhu Sudan,et al.  A reliable dissemination protocol for interactive collaborative applications , 1995, MULTIMEDIA '95.

[5]  Stanley B. Zdonik,et al.  Dissemination-based data delivery using broadcast disks , 1995, IEEE Wirel. Commun..

[6]  V. Jacobson,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995, SIGCOMM '95.

[7]  Marek Karpinski,et al.  An XOR-based erasure-resilient coding scheme , 1995 .

[8]  Steven McCanne,et al.  Receiver-driven layered multicast , 1996, SIGCOMM '96.

[9]  Christian Huitema,et al.  The case for packet level FEC , 1996, Protocols for High-Speed Networks.

[10]  Ernst W. Biersack,et al.  Reliable multicast: where to use FEX , 1996, Protocols for High-Speed Networks.

[11]  Azer Bestavros,et al.  AIDA-based real-time fault-tolerant broadcast disks , 1996, Proceedings Real-Time Technology and Applications.

[12]  Don Towsley,et al.  Packet loss correlation in the MBone multicast network , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[13]  Sanjoy Paul,et al.  RMTP: a reliable multicast transport protocol , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[14]  Luigi Rizzo,et al.  A reliable multicast data distribution protocol based on software FEC techniques , 1997, The Fourth IEEE Workshop on High-Performance Communication Systems.

[15]  Jim Gemmell,et al.  Using Multicast FEC to Solve the Midnight Madness Problem , 1997 .

[16]  Daniel A. Spielman,et al.  Practical loss-resilient codes , 1997, STOC '97.

[17]  C. Kenneth Miller,et al.  Reliable multicast protocols: a practical view , 1997, Proceedings of 22nd Annual Conference on Local Computer Networks.

[18]  Luigi Rizzo,et al.  Effective erasure codes for reliable computer communication protocols , 1997, CCRV.

[19]  Ernst W. Biersack,et al.  Asynchronous Multicast Push: AMP , 1997 .

[20]  Donald F. Towsley,et al.  Parity-based loss recovery for reliable multicast transmission , 1997, TNET.

[21]  Georg Carle,et al.  How bad is reliable multicast without local recovery? , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[22]  Jon Crowcroft,et al.  TCP-like congestion control for layered multicast data transfer , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[23]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[24]  Dispersity Routing,et al.  Dispersity Routing , .