Email this article A Novel HAVE Message of Peer-to-peer Protocol in BitTorrent Systems
Abstract
In BitTorrent systems, there are eleven types of messages for data communication between the peers, among which HAVE, REQUEST and PIECE messages are the three main transmission parts in terms of quantity and flow. In order to improve the efficiency of network transmission and decrease the management costs of file delivery, this paper investigates the mechanism of HAVE message of BitTorrent systems and propose a novel MultiHAVE message scheme, which comprises several HAVE messages via a proper set timer. Experiment results show that under the environment of high bandwidth and consistent peers, together with assistant of the timer, the flow ratio of MultiHAVE message to HAVE message can be reduced to 11%, so MultiHAVE message can decrease the flow of messages and prevent the HAVE message storm efficiently. Furthermore, MultiHAVE message can adapt itself to various BT systems with various bandwidths. If the action of network peers is inconsistent, it can degenerate to the original HAVE message and keep the high performance of BitTorrent systems.
Keywords
References
“Bittorrent,” http://www.bittorrent.com/.
B. Cohen, “Incentives build robustness in BitTorrent,” in First Workshop on Economics of Peer-to-peer Systems, Berkeley, USA, June 2003.
R. L. Xia and J. K. Muppala, “A survey of BitTorrent performance,” IEEE Communications Surveys & Tutorials, 2010, vol. 12, no 2, pp. 140-158.
http://dx.doi.org/10.1109/SURV.2010.021110.00036
Andrew Parker. “The True Picture of Peer-to-Peer Filesharing”. http://www.cachelogic.com/research/slide9.php, May 2005.
T. Karagiannis, A. Broido, M. Faloutsos, and K. C. Claffy. “Transport Layer Identification of P2P Traffic”. In Proceedings of ACM IMC, Taormina, Sicily, Italy, October 2004.
T. Karagiannis, A. Broido, N. Brownlee, and K. C. Claffy. “Is P2P Dying or Just Hiding?”. In Proceedings of IEEE GLOBECOM, Dalla, Texas, USA, Nov. 29 - Dec. 3, 2004. A. Qureshi, “Exploring proximity based peer selection in a BitTorrentlike protocol,” MIT 6.824 student project, 2004 R. Bindal, P. Cao, W. Chan, J. Medved, G. Suwala, T. Bates, and A. Zhang, “Improving traffic locality in BitTorrent via biased neighbor selection,” in ICDCS ’06: Proc. 26th IEEE International Conference on Distributed Computing Systems. Washington, DC, USA: IEEE Computer Society, 2006, p. 66.
S. Yamazaki, H. Tode, and K. Murakami, “CAT: A cost-aware BitTorrent,” in 32nd IEEE Conference on Local Computer Networks (LCN 2007), Oct 2007, pp. 226–227.
P. Garbacki, A. Iosup, D. Epema, and M. van Steen, “2fast: Collaborative downloads in p2p networks,” in P2P ’06: Proc. Sixth IEEE International Conference on Peer-to-Peer Computing. Washington, DC, USA: IEEE Computer Society, 2006, pp. 23–30.
P. Garbacki, D. Epema, and M. van Steen, “An amortized tit-for-tat protocol for exchanging bandwidth instead of content in p2p networks,” Self-Adaptive and Self-Organizing Systems, 2007. SASO ’07. First International Conference on, pp. 119–128, July 2007.
M. Sirivianos, J. Park, R. Chen, and X. Yang, “Freeriding in BitTorrent networks with the large view exploit,” in IPTPS’07, 2007. Arnaud Legout, Guillaume Urvoy-Keller, and Pietro Michiardi. “Understanding BitTorrent: An Experimental Perspective”. Technical Report, INRIA, Sophia Antipolis, July 2005.
Full Text: PDF