A Novel Optimistic Unchoking Algorithm for BitTorrent

Author

Ma, Zuhui ; Qiu, Dongyu

Author_Institution

Electr. & Comput. Eng., Concordia Univ., Montreal, QC

fYear

2009

fDate

10-13 Jan. 2009

Firstpage

1

Lastpage

4

Abstract

Optimistic unchoking plays an important role in BitTorrent peer-to-peer (P2P) file sharing networks. Peers use optimistic unchoking to find upload bandwidth information about their neighbors. However, free-riders can also take advantage of optimistic unchoking and download from the network without uploading anything. In this paper, we propose a novel optimistic unchoking algorithm for BitTorrent. The main purposes of our algorithm are to prevent free-riding and to improve the efficiency of optimistic unchoking. We then propose a stochastic model to analyze the performance of our algorithm. We also verify the results by simulations. Both theoretical and simulation results show that our algorithm can effectively prevent free-riding and significantly improve the download rate of normal peers at the same time.

Keywords

peer-to-peer computing; stochastic processes; BitTorrent peer-to-peer file sharing networks; bandwidth information; optimistic unchoking algorithm; stochastic model; Algorithm design and analysis; Bandwidth; Computer networks; Internet; Network servers; Peer to peer computing; Performance analysis; Scalability; Stochastic processes; Web server;

fLanguage

English

Publisher

ieee

Conference_Titel

Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE

Conference_Location

Las Vegas, NV

Print_ISBN

978-1-4244-2308-8

Electronic_ISBN

978-1-4244-2309-5

Type

conf

DOI

10.1109/CCNC.2009.4784859

Filename

4784859