DMCA
A Digital Fountain Approach to Asynchronous Reliable Multicast (2002)
Cached
Download Links
| Venue: | IEEE Journal on Selected Areas in Communications |
| Citations: | 173 - 9 self |
BibTeX
@ARTICLE{Byers02adigital,
author = {John W. Byers and Michael Luby and Michael Mitzenmacher},
title = {A Digital Fountain Approach to Asynchronous Reliable Multicast},
journal = {IEEE Journal on Selected Areas in Communications},
year = {2002},
volume = {20},
pages = {1528--1540}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract—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. Index Terms—Content delivery, erasure codes, forward error correction, reliable multicast, scalability. I.
Keyphrases
digital fountain asynchronous reliable multicast digital fountain approach erasure code standard erasure code reliable delivery large block size vast number high loss rate performance measurement heterogeneous receiver index term content delivery reliable multicast broadcast protocol new class experimental system new multicast optimal efficiency feedback channel scalable protocol error correction rich content autonomous receiver
