ACM Home Page
Please provide us with feedback. Feedback
Drawing crowds and bit welfare
Full text PdfPdf (1.22 MB)
Source ACM SIGecom Exchanges archive
Volume 5 ,  Issue 4  (July 2005) table of contents
Pages: 31 - 40  
Year of Publication: 2005
Author
Eytan Adar  Hewlett-Packard Laboratories, Palo Alto, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120717.1120722
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
{1}. Adar, E. and B.A. Huberman, "Free Riding on Gnutella," First Monday, 5(10), 2000.
 
2
{2}. Bellissimo, A., B.N. Levine, and P. Shenoy, "Exploring the Use of BitTorrent as the Basis for a Large Trace Repository," University of Massachusetts Technical Report 04-41, June 2004.
 
3
{3}. Bharambe, A.R., and C. Herley, "Analyzing and Improving BitTorrent Performance," Microsoft Technical Report MSR-TR-2005-03, Feb. 2005.
 
4
{4}. BitTorrent Mailing List, http://groups.yahoo.com/group/BitTorrent/.
 
5
{5}. BitTorrent, The Official Homepage, http://www.bittorrent.com.
 
6
{6}. The BitTorrent Specification, available at: http://wiki.theory.org/BitTorrentSpecification.
 
7
{7}. Cohen, B., "Incentives Build Robustness in BitTorrent," 1st Workshop on Economics of Peer-to-Peer Systems, Jun. 2003.
8
 
9
{9}. Ganesan, P., and M. Seshadri, "On Cooperative Content Distribution and the Price of Barter," Stanford Technical Report 2005-4, Feb. 2005.
 
10
{10}. de Veciana, G., and X. Yang, "Fairness, incentives, and performance in peer-to-peer networks," 41st Annual Allerton Conference on Communication, Control and Computing, Monticello, October 2003.
11
 
12
{12}. Izal, M., G. Urvoy-Keller, E.W. Biersack, P.A. Felber, A. Al Hamra, and L. Garces-Erice, "Dissecting BitTorrent: Five Months in a Torrent's Lifetime," Passive & Active Measurement Workshop, Aug. 2004.
 
13
{13}. Pouwelse, J.A., P. Garbacki, D.H.J. Epema, and H.J. Sips, "The BitTorrent P2P File-Sharing System: Measurements and Analysis" 4th International Workshop on Peer-to-Peer Systems, February 2005.
14
 
15
{15}. Qureshi, A., "Exploring Proximity Based Peer Selection in BitTorrent-like Protocol," MIT 6.824 student project, 2004.
 
16
{16}. Raiffa, H., The Art and Science of Negotiation, Belknap Press, 1985.
 
17
{17}. Sherwood, R., R. Braud, B. Bhattacharjee, "Slurpie: A Cooperative Bulk Data Transfer Protocol," IEEE Infocom, Mar. 2004.
 
18
{18}. Thayler, R.H., "Anomalies: The Ultimatum Game," Journal of Economic Perspectives, 2(4), pp. 195-206.