BISTRO: BitTorrent Based on Space-Time Trade-Off


Due to the content bundling and the dramatic increase of content size, the download performance in peer-to-peer networks has become a research focus again recently. In this paper, we propose a novel approach to improve the download performance based on the classical space-time trade-off. With the approach, a peer can speed up local downloads in peer-to-peer networks by contributing a portion of local hard disks for the content distribution in peer-to-peer networks. The contribution can bring performance improvement to each peer following the approach and in the meantime improve the overall content distribution performance in a peer-to-peer network. Based on the approach, we propose BISTRO, a BitTorrent based on space-time trade-off. The BISTRO is compatible with the vanilla BitTorrent. Our extensive experiments show that BISTRO can significantly reduce the download time.

Share and Cite:

Lun, R. , Zhu, Y. and Fu, H. (2013) BISTRO: BitTorrent Based on Space-Time Trade-Off. Communications and Network, 5, 618-624. doi: 10.4236/cn.2013.53B2111.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] D. Menasche, G. Neglia, D. Towsley and S. Zilberstein, “Strategicreasoning about Bundling in Swarming Systems,” International Conference on Game Theory for Networks, 2009, pp. 611-620.
[2] D. S. Menasche, A. A. de Aragao Rocha, B. Li, D. F. Towsley and A. Venkataramani, “Content Availability and Bundling in Swarming Systems,” Proceedings of the ACM Conference on Emerging Networking Experiments and Technology, 2009, pp. 121-132.
[3] J. Han, S. Kim, T. Chung, T. T. Kwon, H.-C. Kim and Y. Choi, “Bundling Practice in Bittorrent: What, How, and Why,” Proceedings of the 12th ACM SIGMETRICS/ PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012, pp. 77-88.
[4] A. Levitin, “Introduction to the Design and Analysis of Algorithms, 3/E,” Addison-Wesley, 2012.
[5], “Internet Status Report”.
[6] A. Carr, “Bit-torrent Has More Users Netflix and Hulu Combined and Doubled”.
[7] K. Eger, “Bittorrent in ns-2, Patch for NS-2.29”.
[8] H. Lee, A. Nakao and J. Kim, “Multi-Swarm Collaboration for Improved Content Availability in Bittorrent-Like Systems,” Proceedings of Consumer Communications and Networking Conference (CCNC), IEEE, 2011, pp. 565-569.
[9] A. M. Mateus and J. M. Peha, “Quantifying Global Transfers of Copyrighted Content Using Bittorrent”.
[10], “Unleash Your Router”.
[11] R. Lun, Y. Zhu and H. Fu, “Bistro: Bittorrent Based on Space-Time Trade off,” Department of Electrical and Computer Engineering, Cleveland State University, Tech. Rep. 20130423a, 2013.
[12], “The Network Simulator NS2”.
[13] N. Zeilemaker, M. Capota, A. Bakker and J. Pouwelse, “Tribler: Searchand Stream,” IEEE International Conference on Peer-to-Peer Computing (P2P), 2011, pp. 164-165.
[14] C.-J. Wu, C.-Y. Li and J.-M. Ho, “Improving the Download Time of BitTorrent-Like Systems,” IEEE International Conference on Communications, 2007, pp. 1125-1129.
[15] M. Lingjun, P.-S. Tsang and K.-S. Lui, “Improving File Distribution Performance by Grouping in Peer-to-Peer Networks,” IEEE Transactions on Network and Service Management, 2009, pp. 149-162.
[16] R. Rahman, M. Meulpolder, D. Hales, J. Pouwelse, D. Epema and H. Sips, “Improving Efficiency and Fairness in p2p Systems with Effort-Based Incentives,” IEEE International Conference on Communications (ICC), 2010, pp. 1-5.
[17] C. Tian, X. Liu, H. Jiang, W. Liu and Y. Wang, “IMPROVING BitTorrent Traffic Performance by Exploiting Geographic Locality,” Global Telecommunications Conference, 2008, pp. 1-5.
[18] F. Lehrieder, G. Dan, T. Hossfeld, S. Oechsner and V. Singeorzan, “Caching for Bittorrent-Like p2p Systems: A Simple Fluid Model and Its Implications,” IEEE/ACM Transactions on Networking, 2011.
[19] J. L. Hennessy and D. A. Patterson, “Computer Architecture: A Quantitative Approach,” 3rd Editon, Morgan Kaufmann Publishers Inc., San Francisco, 2002.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.