Digital fountains: A survey and look forward

2004 IEEE Information Theory Workshop - Proceedings, ITW

Volumn , Issue , 2004, Pages 271-276

  Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL FOUNTAINS INC (CO); LOW-DENSITY PARITY-CHECK (LDPC) CODES; NETWORK COMMUNICATION; TORNADO CODES;

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; INFORMATION THEORY; PACKET NETWORKS; PATENTS AND INVENTIONS;

COMMUNICATION SYSTEMS;

EID: 19544394827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (35)

1. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery over adaptive overlay networks. In Proceedings of ACM SIGCOMM Conference, pp. 47-60, 2002.
2. Journal version to appear in IEEE/ACM Transactions on Networking, 2004.
3. J. Byers, G. Horn, M. Luby, M. Mitzenmacher, and W. Shaver. FLID-DL: congestion control for layered multicast. IEEE Journal on Selected Areas in Communications, 20(8), pp. 1558-1570, October 2002.
4. J. Byers, M. Luby, and M. Mitzenmacher. A Digital Fountain Approach to Asynchronous Reliable Multicast. IEEE Journal on Selected Areas in Communications, 20(8), pp. 1528-1540, October 2002.
5. (A preliminary version appeared in ACM SIGCOMM '98, pp. 56-67).
6. J. Byers, M. Luby, and M. Mitzenmacher. Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. In Proceedings of INFOCOM 1999, pp. 275-283.
7. R. G. Gallager. Low-density parity check codes. PhD thesis, MIT, 1963. Manuscript published by MIT Press.
8. A. Haken, M. Luby, G. Horn, D. Hernek, J. Byers, and M. Mitzenmacher. Generating high weight encoding symbols using a basis. U.S. Patent #6,411,223. Issued June 25, 2002.
9. D. Kostić, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: high bandwidth data dissemination using an overlay mesh. In Proceedings of the 19th ACM Symposium on Operating Systems Principles, pp. 282-297, 2003.
10. G.-I. Kwon and J. Byers. ROMA: Reliable overlay multicast with loosely coupled TCP connections. Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communication Societies (Infocom 2004), Hong Kong, March 2004.
11. M. Luby. Information additive code generator and decoder for communication systems. U.S. Patent #6,307,487. Issued October 23, 2001.
12. M. Luby. Information additive code generator and decoder for communication systems. U.S. Patent #6,373,406. Issued April 16, 2002. (continuation to #6,307,487).
13. M. Luby. Information additive code generator and decoder for communication systems. U.S. Patent #6,614,366. Issued September 2, 2003. (continuation to #6,373,406).
14. M. Luby. Information additive group code generator and decoder for communication systems. U.S. Patent #6,320,520. Issued November 20, 2001.
15. M. Luby. LT codes. In Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 271-282, 2002.
16. M. Luby, V. Goyal, S. Skaria, and G. Horn. Wave and equation based rate control using multicast round trip time. In Proceedings of ACM SIGCOMM Conference, pp. 191-204, 2002.
17. M. Luby, G. Horn, J. Persch, J. Byers, A. Haken, and M. Mitzenmacher. On demand encoding with a window. U.S. Patent #6,486,803. Issued November 26, 2002.
18. M. Luby and M. Mitzenmacher. Loss resilient code with double heavy tailed series of redundant layers. U.S. Patent #6,195,777. Issued February 27, 2001.
19. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman. Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47(2):569-584, February 2001.
20. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In ACM STOC '97, pages 150-159, 1997.
21. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, V. Stemann, and D. Spielman. Message encoding with irregular graphing. U.S. Patent #6,163,870. Issued December 19, 2000.
22. M. Luby, M. A. Shokrollahi, V. Stemann, M. Mitzenmacher, and D. Spielman. Irregularly graphed encoding technique. U.S. Patent #6,081,909. Issued June 27, 2000.
23. M. Luby, M. A. Shokrollahi, V. Stemann, M. Mitzenmacher, and D. Spielman. Loss resilient decoding technique. U.S. Patent #6,073,250. Issued June 6, 2000.
24. A. Mahanti, D. L. Eager, M. K. Vernon, and D. Sundaram-Stukel. Scalable On-Demand Media Streaming with Packet Loss Recovery. IEEE/ACM Transactions on Networking, Vol. 11, No. 2, pp. 195-209, April 2003.
25. N. F. Maxemchuk, Dispersity Routing in Store and Forward Networks. Ph. D. thesis, University of Pennsylvania, May 1975.
26. P. Maymounkov. Online Codes. NYU Technical Report TR2002-833, November 2002.
27. P. Maymounkov and D. Mazières Rateless codes and big downloads. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, February 2003. Available in Lecture Notes in Computer Science 2735, pp. 245-255, Springer, 2003.
28. J. Plank and M. Thomason. On the practical use of LDPC erasure codes for distributed storage applications. Technical Report UT-CS-03-510, University of Tennessee, September 2003.
29. M. O. Rabin. Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. Journal of the ACM, Volume 38, pp. 335-348, 1989.
30. I.S. Reed and G. Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8:300-304, June 1960.
31. T. Richardson and R. Urbanke. Efficient encoding of low-density parity-check codes. IEEE Transactions on Information Theory, 47(2), pp. 638-656, 2001.
32. P. Rodriguez and E. Biersack. Dynamic parallel access to replicated content in the Internet. IEEE/ACM Transactions on Networking, 10(4), pp. 455-465, 2002.
33. S. Rost, J. Byers, and A. Bestavros. The Cyclone Server Architecture: streamlining delivery of popular content. Computer Communications, 25(4), pp. 403-412, 2002.
34. A. Shokrollahi. Raptor codes. Preprint available at http://algo.epfl.ch/pubs/raptor.pdf.
35. A. Shokrollahi, S. Lassen, and M. Luby. Multi-stage code generator and decoder for communication systems. U.S. Patent Application #20030058958.