Book ChapterDOI
Rateless Codes and Big Downloads
Petar Maymounkov,David Mazières +1 more
- pp 247-255
Reads0
Chats0
TLDR
When nodes leave the network in the middle of uploads, the algorithm minimizes the duplicate information shared by nodes with truncated downloads, so any two peers with partial knowledge of a given file can almost always fully benefit from each other's knowledge.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.read more
Citations
More filters
Journal ArticleDOI
SplitStream: high-bandwidth multicast in cooperative environments
TL;DR: The design and implementation of SplitStream are presented and experimental results show that SplitStream distributes the forwarding load among all peers and can accommodate peers with different bandwidth capacities while imposing low overhead for forest construction and maintenance.
Proceedings ArticleDOI
Network coding for large scale content distribution
TL;DR: It is demonstrated through simulations of scenarios of practical interest that the expected file download time improves by more than 20-30% with network coding compared to coding at the server only and, byMore than 2-3 times compared to sending unencoded information.
Proceedings Article
Total recall: system support for automated availability management
TL;DR: The motivation, architecture and implementation for a new peer-to-peer storage system, called TotalRecall, that automates the task of availability management, which automatically measures and estimates the availability of its constituent host components, predicts their future availability based on past behavior, and delivers user-specified availability while maximizing efficiency.
Proceedings Article
Democratizing content publication with coral
TL;DR: CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet connection.
Proceedings ArticleDOI
Erasure-coding based routing for opportunistic networks
TL;DR: A novel forwarding algorithm based on the idea of erasure codes, which allows use of a large number of relays while maintaining a constant overhead, which results in fewer cases of long delays with a fixed amount of overhead is proposed.
References
More filters
Proceedings Article
LT codes
TL;DR: LT codes are introduced, the first rateless erasure codes that are very efficient as the data length grows, and are based on EMMARM code, which was introduced in version 2.0.
Proceedings ArticleDOI
Practical loss-resilient codes
TL;DR: In this article, the authors presented randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity.
Journal ArticleDOI
An analysis of internet content delivery systems
TL;DR: This paper examines content delivery from the point of view of four content delivery systems: HTTP web traffic, the Akamai content delivery network, and Kazaa and Gnutella peer-to-peer file sharing traffic.
Proceedings ArticleDOI
Analysis of random processes via And-Or tree evaluation
TL;DR: These tools provide a unifying, intuitive, and powerful framework for carrying out the analysis of several previously studied random processes of interest, including random loss-resilient codes, solving random k-SAT formula using the pure literal rule, and the greedy algorithm for matchings in random graphs.
Proceedings ArticleDOI
Informed content delivery across adaptive overlay networks
TL;DR: This work makes the case for an erasure-resilient encoding of the content, and demonstrates the performance benefits of informed content-delivery mechanisms and how they complement existing overlay network architectures.