Please use this identifier to cite or link to this item:
Title: Robust and efficient incentives for cooperative content distribution
Authors: Yang, Xiaowei 
Jarecki, Stanisaw 
Sirivianos, Michael 
Major Field of Science: Natural Sciences
Field Category: Computer and Information Sciences
Keywords: Internet;Cryptography;Communication, Networking & Broadcasting
Issue Date: Dec-2009
Source: IEEE/ACM transactions on networking, 2009, vol. 17, no. 6, pp. 1766-1779
Volume: 17
Issue: 6
Start page: 1766
End page: 1779
Journal: IEEE/ACM Transactions on Networking 
Abstract: Content distribution via the Internet is becoming increasingly popular. To be cost-effective, commercial content providers are now using peer-to-peer (P2P) protocols such as BitTorrent to save bandwidth costs and to handle peak demands. When an online content provider uses a P2P protocol, it faces an incentive issue: how to motivate its clients to upload to their peers. This paper presents Dandelion, a system designed to address this issue. Unlike previous incentive-compatible systems, such as BitTorrent, our system provides non-manipulable incentives for clients to upload to their peers. A client that honestly uploads to its peers is rewarded in the following two ways. First, if its peers are unable to reciprocate its uploads, the content provider rewards the client's service with credit. This credit can be redeemed for discounts on paid content or other monetary rewards. Second, if the client's peers possess content of interest and have appropriate uplink capacity, the client is rewarded with reciprocal uploads from its peers. In designing Dandelion, we trade scalability for the ability to provide robust incentives for cooperation. The evaluation of our prototype system on PlanetLab demonstrates the viability of our approach. A Dandelion server that runs on commodity hardware with a moderate access link is capable of supporting up to a few thousand clients. The download completion time for these clients is substantially reduced due to the additional upload capacity offered by strongly incentivized uploaders
ISSN: 1558-2566
DOI: 10.1109/TNET.2009.2021655
Rights: © IEEE
Type: Article
Affiliation: Duke University 
Affiliation : Duke University 
University of California 
Appears in Collections:Άρθρα/Articles

CORE Recommender
Show full item record

Citations 20

checked on Aug 31, 2020


Last Week
Last month
checked on Oct 26, 2020

Page view(s) 50

Last Week
Last month
checked on Oct 28, 2020

Google ScholarTM



Items in KTISIS are protected by copyright, with all rights reserved, unless otherwise indicated.