document: 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
doc_bio_tags: O B I O O B I I O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O B I O O O O O O O B I O O B I O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O
extractive_keyphrases: digital fountain asynchronous reliable multicast autonomous receivers broadcast protocols scalable protocol heterogeneous receivers optimal efficiency high loss rates erasure codes performance measurements
abstractive_keyphrases: multicast protocol large block size experimental system performance internet fec codes forward error correction rs codes tornado codes luby transform codes bulk data distribution ip multicast simulation results interoperability content distribution methods reed-solomon codes decoder