Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Drawing crowds and bit welfare

Drawing crowds and bit welfare Tit-for-tat style file sharing systems such as BitTorrent have proven to be remarkably effective in dealing with highly popular content. By explicitly addressing free-riding behavior, a "greedy" tit-for-tat approach encourages sharing and succeeds in providing a higher quality of service. However, in situations where a file is not as popular, or the rate of demand is not high, it is frequently difficult to obtain the file in a timely manner. In this paper we demonstrate how additionally greedy behavior on the part of some peers can counterintuitively address this problem. In particular we discuss two possible techniques by which peers, with complete file copies, strategically reduce their effort while improving total network performance by various metrics. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Drawing crowds and bit welfare

Adar, Eytan
ACM SIGecom Exchanges , Volume 5 (4) – Jul 1, 2005
Download PDF
10 pages

Loading next page...
 
/lp/association-for-computing-machinery/drawing-crowds-and-bit-welfare-BxpMa8Bwnr

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2005 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1120717.1120722
Publisher site
See Article on Publisher Site

Abstract

Tit-for-tat style file sharing systems such as BitTorrent have proven to be remarkably effective in dealing with highly popular content. By explicitly addressing free-riding behavior, a "greedy" tit-for-tat approach encourages sharing and succeeds in providing a higher quality of service. However, in situations where a file is not as popular, or the rate of demand is not high, it is frequently difficult to obtain the file in a timely manner. In this paper we demonstrate how additionally greedy behavior on the part of some peers can counterintuitively address this problem. In particular we discuss two possible techniques by which peers, with complete file copies, strategically reduce their effort while improving total network performance by various metrics.

Journal

ACM SIGecom Exchanges – Association for Computing Machinery

Published: Jul 1, 2005

There are no references for this article.