Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Enhancing Neighborship Consistency for Peer-to-Peer Distributed Virtual Environments
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Antfarm: efficient content distribution with managed swarms
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Treat-before-trick: Free-riding prevention for BitTorrent-like peer-to-peer networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Reciprocity and barter in peer-to-peer systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
TopBT: a topology-aware and infrastructure-independent bittorrent client
INFOCOM'10 Proceedings of the 29th conference on Information communications
An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing
IEEE Transactions on Computers
Do incentives build robustness in bit torrent
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
EnhancedBit: Unleashing the potential of the unchoking policy in the BitTorrent protocol
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.