(Enter summary)
Abstract: This paper presents a novel algorithm for downloading big files from multiple sources in peer-to-peer networks. The algorithm is simple, but offers several compelling properties. It ensures low handshaking overhead between peers that download files (or parts of a files) from each other. It is computationally efficient, with cost linear in the amount of data transfered. Most importantly, when nodes leave the network in the middle of uploads, the algorithm minimizes the duplicate information... (Update)
Cited by: More
Democratizing content publication with Coral - Michael Freedman Eric (2004)
(Correct)
Maintaining High Bandwidth under Dynamic Network Conditions - Dejan Kostic Ryan
(Correct)
Total Recall: System Support for Automated Availability.. - Ranjita Bhagwan Kiran (2004)
(Correct)
Similar documents (at the sentence level):
78.0%: Rateless Codes and Big Downloads - Petar Maymounkov And (2003)
(Correct)
Active bibliography (related documents): More All
0.3: Network Applications of Bloom Filters: A Survey - Broder, Mitzenmacher (2002)
(Correct)
0.2: Fast PDA Synchronization Using Characteristic.. - Trachtenberg.. (2002)
(Correct)
0.2: Demonstrating Data Possession and Uncheatable Data Transfer - Ecio Luiz Gazzoni (2006)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
1.1: LT Codes - Luby (2002)
(Correct)
0.4: Limited Randomness LT Codes - Harrelson, Ip, Wang
(Correct)
0.4: On-the-Fly Verification of Rateless Erasure Codes for.. - Krohn, Freedman.. (2004)
(Correct)
Related documents from co-citation: More All
12: LT codes
- Luby - 2002
9: Informed content delivery across adaptive overlay networks
- Byers, Considine et al. - 2002
7: A case for end system multicast
- Chu, Rao et al. - 2000
BibTeX entry: (Update)
P. Maymounkov and D. Mazieres, "Rateless Codes and Big Downloads," in Proc. of the 2nd International Workshop on Peer-to-Peer Systems, 2003. http://citeseer.ist.psu.edu/article/maymounkov03rateless.html More
@misc{ maymounkov03rateless,
author = "P. Maymounkov and D. Mazieres",
title = "Rateless Codes and Big Downloads",
text = "P. Maymounkov and D. Mazieres, Rateless Codes and Big Downloads, in Proc.
of the 2nd International Workshop on Peer-to-Peer Systems, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/maymounkov03rateless.html" }
Citations (may not include all citations):
109
Practical Loss-Resilient Codes
- Luby, Mitzenmacher et al. - 1997
73
An analysis of internet content delivery systems
- Saroiu, Gummadi et al. - 2002
68
Informed Content Delivery Across Adaptive Overlay Networks
- Byers, Considine et al. - 2002
33
Set Reconciliation with Nearly Optimal Communication Complex..
- Minsky, Trachtenberg et al. - 2001
33
Analysis of Random Processes via And-Or Tree Evaluation
- Luby, Mitzenmacher et al. - 1998
29
LT codes
- Luby - 2002
10
Data verification and reconciliation with generalized error-..
- Karpovsky, Levitin et al. - 2001
10
Practical Set Reconciliation
- Minsky, Trachtenberg - 2002
4
Technical Report TR (context) - Maymounkov - 2002
3
Fast Approximate Reconciliation of Set Differences
- Byers, Considine et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://iptps03.cs.berkeley.edu/program.html): More
Efficient Broadcast in Structured P2P Networks - El-Ansary, Alima, Brand, Haridi (2003)
(Correct)
A Simple Fault Tolerant Distributed Hash Table - Moni Naor Udi (2003)
(Correct)
On the Feasibility of Peer-to-Peer Web Indexing and.. - Li, Loo, Hellerstein.. (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC