A digital fountain approach to asynchronous reliable multicast

The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers 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 receivers to acquire content 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 two new classes 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]  Sneha Kumar Kasera,et al.  Improving reliable multicast using active parity encoding services , 2004, Comput. Networks.

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

[3]  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.

[4]  Donald F. Towsley,et al.  Efficient rate-controlled bulk data transfer using multiple multicast groups , 2003, TNET.

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

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

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

[8]  Michael Mitzenmacher,et al.  FLID-DL: congestion control for layered multicast , 2000, COMM '00.

[9]  Don Towsley,et al.  Parity-based loss recovery for reliable multicast transmission , 1998, SIGCOMM '97.

[10]  Steven McCanne,et al.  Low-Complexity Video Coding for Receiver-Driven Layered Multicast , 1997, IEEE J. Sel. Areas Commun..

[11]  Sneha Kumar Kasera,et al.  A comparison of server-based and receiver-based local recovery approaches for scalable reliable multicast , 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.

[12]  Jörg Nonnenmacher Asynchronous multicast push : AMP , 1997 .

[13]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[14]  TowsleyDon,et al.  Parity-based loss recovery for reliable multicast transmission , 1997 .

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

[16]  Jeffrey Considine,et al.  Informed content delivery across adaptive overlay networks , 2002, IEEE/ACM Transactions on Networking.

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

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

[19]  George Varghese,et al.  An error control scheme for large-scale multicast applications , 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.

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

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

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

[23]  Sneha Kumar Kasera,et al.  Improving reliable multicast using active parity encoding services (APES) , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[25]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[26]  Michael Mitzenmacher,et al.  Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[27]  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.

[28]  M. Klamkin,et al.  Extensions of the birthday surprise , 1967 .

[29]  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.

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

[31]  Nicholas F. Maxemchuk,et al.  DISPERSITY ROUTING IN STORE-AND-FORWARD NETWORKS. , 1975 .

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

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

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