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 hand-shaking overhead between peers that download files (or parts of 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 shared by nodes with truncated downloads. Thus, any two peers with partial knowledge of a given file can almost always fully benefit from each other’s knowledge. Our algorithm is made possible by the recent introduction of linear-time, rateless erasure codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Byers, J., Considine, J., Mitzenmacher, M.: Fast Approximate Reconciliation of Set Differences. In Draft paper, available as BU Computer Science TR 2002-019 (2002)
Byers, J., Considine, J., Mitzenmacher, M., Rost, S.: Informed Content Delivery Across Adaptive Overlay Networks. In: SIGCOMM (2002)
Karpovsky, M., Levitin, L., Trachtenberg, A.: Data verification and reconciliation with generalized error-control codes. In: 39th Annual Allerton Conference on Communication, Control, and Computing (2001)
Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D., Stemann, V.: Practical Loss-Resilient Codes. In: STOC (1997)
Luby, M., Mitzenmacher, M., Shokrollahi, A.: Analysis of Random Processes via And-Or Tree Evaluation. In: SODA (1998)
Jed McCaleb. EDonkey2000, http://www.edonkey2000.com/
Luby, M.: LT codes. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science (2002)
Maymounkov, P.: Online Codes. Technical Report TR2002-833, New York University (October 2002)
Saroiu, S., Gummadi, K.P., Dunn, R.J., Gribble, S.D., Levy, H.M.: An analysis of internet content delivery systems. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation, December 2002, pp. 315–327 (2002)
Minsky, Y., Trachtenberg, A., Zippel, R.: Set Reconciliation with Nearly Optimal Communication Complexity. In: International Symposium on Information Theory (2001)
Minsky, Y., Trachtenberg, A.: Practical Set Reconciliation. In: 40th Annual Allerton Conference on Communication, Control, and Computing (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maymounkov, P., Mazières, D. (2003). Rateless Codes and Big Downloads. In: Kaashoek, M.F., Stoica, I. (eds) Peer-to-Peer Systems II. IPTPS 2003. Lecture Notes in Computer Science, vol 2735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45172-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-45172-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40724-9
Online ISBN: 978-3-540-45172-3
eBook Packages: Springer Book Archive