Rateless codes and big downloads

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2735, Issue , 2003, Pages 247-255

  Maymounkov, Petar ^a   Mazières, David ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

COMPUTATIONALLY EFFICIENT; ERASURE CODES; INFORMATION SHARED; LINEAR TIME; MULTIPLE SOURCE; NOVEL ALGORITHM; PARTIAL KNOWLEDGE; RATELESS CODES;

PEER TO PEER NETWORKS;

EID: 35248857528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45172-3_23     Document Type: Article

References (11)

1. J. Byers, J. Considine, and M. Mitzenmacher. Fast Approximate Reconciliation of Set Differences. In Draft paper, available as BU Computer Science TR 2002-019, 2002.
2. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed Content Delivery Across Adaptive Overlay Networks. In SIGCOMM, 2002.
3. M. Karpovsky, L. Levitin, and A. Trachtenberg. Data verification and reconciliation with generalized error-control codes. In 39th Annual Allerton Conference on Communication, Control, and Computing, 2001.
4. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann. Practical Loss-Resilient Codes. In STOC, 1997.
5. M. Luby, M. Mitzenmacher, and A. Shokrollahi. Analysis of Random Processes via And-Or Tree Evaluation. In SODA, 1998.
6. Jed McCaleb. EDonkey2000. http://www.edonkey2000.com/.
7. Michael Luby. LT codes. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002.
8. Petar Maymounkov. Online Codes. Technical Report TR2002-833, New York University, October 2002.
9. Stefan Saroiu, Krishna P. Gummadi, Richard J. Dunn, Steven D. Gribble, and Henry M. Levy. An analysis of internet content delivery systems. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation, pages 315-327, December 2002.
10. Y. Minsky, A. Trachtenberg, and R. Zippel. Set Reconciliation with Nearly Optimal Communication Complexity. In International Symposium on Information Theory, 2001.
11. Y. Minsky and A. Trachtenberg. Practical Set Reconciliation. In 40th Annual Allerton Conference on Communication, Control, and Computing, 2002.