Back to results list
Please use this identifier to cite or link to this item:
|Title:||Modeling, analyzing and improving the performance of BitTorrent swarming systems||Authors:||Cai, Qingchao||Keywords:||Peer-to-peer architecture (Computer networks)
Downloading of data.
Hong Kong Polytechnic University -- Dissertations
|Issue Date:||2013||Publisher:||The Hong Kong Polytechnic University||Abstract:||BitTorrent is one of the most popular peer-to-peer content distribution systems, and plays a dominant role with respect to the Internet traffic. Although BitTorrent is very effective in terms of bandwidth utilization, it is confronted with a serious problem that in many BitTorrent swarms, peers cannot complete the download due to the lack of some content blocks. Therefore, it is very important to find solutions to this problem, which we call content availability, as they can significantly enhance the service capability and performance of BitTorrent swarms. This work aims to develop an insightful understanding to the performance of BitTorrent swarming systems, and explore how it can be improved, with a special focus on content availability. In this study, we first perform a comprehensive study on the modeling and analysis of BitTorrent swarms. We derive the closed-form expressions for the performance metrics of Bit-Torrent swarms related to content availability, and investigate the influence of bundling on content availability. It is shown that bundling could greatly improve the availability of content, and that in a bundled swarm, peers could complete the download earlier than they would do in the individual swarm, given an appropriate number of files are bundled. In addition, the altruistic behavior of peers is also studied. We present an analysis on how peers' altruistic behavior affects the length of the residual active period after the leave of the publisher, and quantify the impact of bundling on the residual active period in the presence of peers' altruistic behavior.
Next, we carry out an in-depth investigation on the feasibility of using network coding to ameliorate content availability of BitTorrent swarms. We first present a mathematical analysis on the potential improvement in the content availability and bandwidth utilization induced by two existing network coding schemes. The analysis reveals that network coding has a large potential to improve content availability, but both of the existing two schemes are not feasible as they either incur a very high coding complexity and disk operation overhead or cannot effectively leverage the potential of improving content availability. In this regard, a simple sparse network coding scheme is proposed, which addresses both the drawbacks in the existing schemes, and a new block scheduling algorithm is also developed in order to accommodate the proposed coding scheme into BitTorrent. The extensive simulation results demonstrate the effectiveness of the proposed coding scheme in terms of improving content availability. Finally, as motivated by the recent development of private BitTorrent communities, we conduct a detailed survey on one of the largest private BitTorrent communities, CHDBits. First, we characterize torrents from the perspectives of age, size, popularity and average user download rate, and then profile the different aspects of CHDBits users, e.g., diurnal access pattern, user traffic, seeding and leeching time. We also develop an in-depth understanding to how CHDBits users participate in downloading and uploading. The survey results suggest some new findings with regard to user behavior: low bandwidth users are more likely to participate in torrents with a smaller content size or a higher popularity, and compared with low bandwidth users, high bandwidth users tend to participate in more torrents, but spend less time in seeding.
|Description:||xviii, 150 leaves : ill. ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577P EIE 2013 Cai
|URI:||http://hdl.handle.net/10397/6164||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|b26160328_link.htm||For PolyU Users||203 B||HTML||View/Open|
|b26160328_ir.pdf||For All Users (Non-printable)||1.5 MB||Adobe PDF||View/Open|
Citations as of Oct 15, 2018
Citations as of Oct 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.