TY - GEN
T1 - Changing the unchoking policy for an enhanced bittorrent
AU - Atlidakis, Vaggelis
AU - Roussopoulos, Mema
AU - Delis, Alex
PY - 2012
Y1 - 2012
N2 - In this paper, we propose a novel optimistic unchoking approach for the BitTorrent protocol whose key objective is to improve the quality of inter-connections amongst peers. In turn, this yields enhanced data distribution without penalizing underutilized and/or idle peers. The suggested policy takes into consideration the number of peers currently interested in downloading from a client that is to be unchoked. Our conjecture is that clients having few peers interested in downloading data from them should be favored with optimistic unchoke intervals. This will enable the clients in question to receive data since they become unchoked faster and consequently, they will trigger the interest of additional peers. In contrast, clients with plenty of "interested" peers should enjoy a lower priority to be selected as "planned optimistic unchoked" as they likely have enough data to forward and have saturated their uplinks. In this context, we increase the aggregate probability that the swarm obtains a higher number of interested-in-cooperation and directly-connected peers leading to improved peer inter-connection. Experimental results indicate that our approach significantly outperforms the existing optimistic unchoking policy.
AB - In this paper, we propose a novel optimistic unchoking approach for the BitTorrent protocol whose key objective is to improve the quality of inter-connections amongst peers. In turn, this yields enhanced data distribution without penalizing underutilized and/or idle peers. The suggested policy takes into consideration the number of peers currently interested in downloading from a client that is to be unchoked. Our conjecture is that clients having few peers interested in downloading data from them should be favored with optimistic unchoke intervals. This will enable the clients in question to receive data since they become unchoked faster and consequently, they will trigger the interest of additional peers. In contrast, clients with plenty of "interested" peers should enjoy a lower priority to be selected as "planned optimistic unchoked" as they likely have enough data to forward and have saturated their uplinks. In this context, we increase the aggregate probability that the swarm obtains a higher number of interested-in-cooperation and directly-connected peers leading to improved peer inter-connection. Experimental results indicate that our approach significantly outperforms the existing optimistic unchoking policy.
KW - Content Distribution
KW - Peer-to-peer
KW - Unchoking
UR - http://www.scopus.com/inward/record.url?scp=84867629990&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867629990&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-32820-6_38
DO - 10.1007/978-3-642-32820-6_38
M3 - Conference contribution
AN - SCOPUS:84867629990
SN - 9783642328190
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 377
EP - 388
BT - Parallel Processing - 18th International Conference, Euro-Par 2012, Proceedings
T2 - 18th International Conference on Parallel Processing, Euro-Par 2012
Y2 - 27 August 2012 through 31 August 2012
ER -