Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64140Full metadata record
| ???org.dspace.app.webui.jsptag.ItemTag.dcfield??? | Value | Language |
|---|---|---|
| dc.contributor.advisor | 莊裕澤(Yuh-Jzer Joung) | |
| dc.contributor.author | Evan Chang | en |
| dc.contributor.author | 張子捷 | zh_TW |
| dc.date.accessioned | 2021-06-16T17:31:45Z | - |
| dc.date.available | 2012-08-22 | |
| dc.date.copyright | 2012-08-22 | |
| dc.date.issued | 2012 | |
| dc.date.submitted | 2012-08-15 | |
| dc.identifier.citation | [1] “IPOQUE, Internet Study 2008/2009,”
http://www.ipoque.com/resources/internet-studies/internet-study-2008_2009 [2] “BitTorrent and Netflix Dominate America’s Internet Traffic”,Oct. 2011 http://torrentfreak.com/bittorrent-and-netflix-dominate-americas-internet-traffic-111027/ [3] N. Andrade, M. Mowbray, A. Lima, G. Wagner, and M. Ripeanu, “Influences on Cooperation in BitTorrent Communities”, in proc. of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems (P2PECON ’05), Philadelphia, PA, USA, pp.111-115 (Aug. 2005) [4] N. Andrade, E. Santos-Neto, F. V. Brasileiro, M. Ripeanu, “Resource demand and supply in bittorrent content sharing communities”, In Computer Networks, Volume 53, Issue 4, pp.515-527 (Mar. 2009) [5] A. Bharambe, C. Herley, V. Padmanabhan, “Analyzing and Improving a BitTorrent Network’s Performance Mechanism”, in Proc. of IEEE Conference on Computer Communications 2006 (IEEE INFOCOM), Barcelona, Spain (Apr. 2006) [6] X. Chen, Y. Jiang, X.-W. Chu, “Measurements, Analysis and Modeling of Private Trackers”, in IEEE Tenth International Conference on Peer-to-Peer Computing (IEEE P2P) Delft, Netherlands (Aug. 2010) [7] A.L.H Chou, L. Golubchik, V. Misra, “BitTorrent: An Extensible Heterogeneous Model”, in Proc. of IEEE 28th Conference on Computer Communications 2009 (IEEE INFOCOM), Rio de Janeiro, Brazil, pp. 585-593 (Apr. 2009) [8] B. Cohen, “Incentives build robustness in BitTorrent”, in Proc. of Workshop on Economics of Peer-to-Peer Systems 2003, Berkeley, USA, May. 2003 [9] B. Cohen. BitTorrent – a new P2P app. Yahoo eGroups, 2007. [10] D. Hales, R. Rahman, B, Zhang, M. Meulpolder, J. Pouwelse, “BitTorrent or BitCrunch: Evidence of a credit squeeze in BitTorrent?”, in Proc. of 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE ‘09), Groningen, Netherlands, pp. 99-104 (Jul. 2009) [11] M. Izal, G. Urvoy-Keller, et.al. “Dissecting BitTorrent: Five Months in a Torrent’s Lifetime”, in Proc. of Passive and Active Measurement Workshop 2004 (PAM), Antibes, France (Apr. 2004) [12] A.L. Jia, R. Rahman, T. Vinko, J.A. Pouwelse, D.H.J. Epema, “Fast download but eternal seeding: the reward and punishment of sharing ratio enforcement”, in Proc. of IEEE International Conference on Peer-to-Peer computing P2P 2011 (IEEE P2P), Kyoto, Japan, pp. 280-289 (Oct. 2011) [13] S. Jun, M. Ahamad, “Incentives in BitTorrent induce free riding”, in Proc. of the ACM SIGCOMM workshop on Economics of peer-to-peer systems, Philadelphia, Pennsylvania, USA (Aug. 2005) [14] S. Kaune, G. Tyson, K. Pussep, “The seeder promotion problem: Measurements, analysis and solution space”, in Proc. of International Conference on Computer Communications and Networks (ICCCN), Zurich (Aug. 2010) [15] A. Legout, G. Urvoy-Keller, P. Michiardi, “Rarest first and choke algorithms are enough”, in Proc. of the 6th ACM SIGCOMM conference on Internet measurement, Brazil, pp. 203-216 (Sept. 2006) [16] D. Levin, K. LaCurts, N. Spring, B Bhattacharjee, “BitTorrent is an Auction: Analyzing and Improving BitTorrent's Incentives”, in Proc. of ACM SIGCOMM 2008 conference on Data communication, Seattle, WA, USA, pp. 243-254 (Aug. 2008) [17] W.C. Liao, F. Papadopoulos, K. Psounis, “Performance analysis of BitTorrent-like systems with heterogeneous users”, Performance Evaluation, Amsterdam, The Netherlands, Vol. 64, No. 9-12, pp. 876-891 (Oct. 2007) [18] W.C. Liao, F. Papadopoulos, and K. Psounis, “Performance analysis of bittorrent-like systems in heterogeneous networks”, University of Southern California, Tech. Rep. CENG-2007-2, 2007. [19] N. Liogkas, R. Nelson, E. Kohler, L. Zhang, “Exploiting bittorrent for fun (but not profit)”, in Proc. of International workshop on Peer-to-Peer Systems (IPTPS ‘06), Santa Barbara, California (Feb. 2006) [20] Z. Liu, P. Dhungel, D. Wu, C. Zhang, K. W. Ross, “Understanding and Improving Incentives in Private P2P Communities”, in Proc. of the 30th International Conference on Distributed Computing Systems (ICDCS), Genoa, Italy, pp. 610-621 (Jun. 2010) [21] T. Locher, P. Moor, S. Schmid, and R. Wattenhofer, “Free riding in BitTorrent is cheap”, in Proc. of the 5th Workshop on Hot Topics in Networks (HotNets-V), Irvine, California (Nov. 2006) [22] M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, A. Venkataramani, “Do incentives build robustness in BitTorrent?”, in Proc. of 4th USENIX Symposium on Networked Systems Design and Implementation (NSDI ’07), Cambridge, MA, USA (Apr. 2007) [23] J.A. Pouwelse, P. Garbacki, D.H.J. Epema, H.J. Sips, “The BitTorrent p2p file-sharing system: Measurements and analysis”, in Technical Report PDS-2004-003, Delft University of Technology, The Netherlands (Apr. 2004) [24] D. Qiu and R. Srikant, “Modeling and Performance Analysis of BitTorrent-like Peer-to-Peer Networks”, in Proc. of ACM SIGCOMM 2004 conference on Applications, technologies, architectures, and protocols for computer communications, Portland, USA (Aug. 2004) [25] M. Ripeanu, M. Mowbray, N. Andrade, A. Lima, “Gifting technologies: a BitTorrent case study”, First Monday, vol. 11(11), Nov. 2006. [26] C. Zhang, P. Dhungel, D. Wu, Z. Liu, K. W. Ross, “BitTorrent Darknets”, in Proc. of IEEE Conference on Computer Communications 2010 (IEEE INFOCOM), San Diego, CA, USA (Mar. 2010) | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/64140 | - |
| dc.description.abstract | BitTorrent(BT)是目前最為廣泛使用的點對點檔案傳輸協定，它曾經長期占據網際網路流量第一名，直到最近才被Netflix超越。其迥異於其他點對點檔案傳輸協定的獨特機制達到了非常好的效率並兼具了成長性，也讓它成為檔案分享社群的不二選擇。但是其機制無法鼓勵使用者在下載完成後做為種子(Seeder)繼續上傳，因此許多社群便導入了Sharing Ratio Enforcement(SRE)這個外部機制來解決這個問題。
在本篇論文中，我們在探討SRE對於BitTorrent系統效能的影響。我們建構了一個數學模型，可以在Flash Crowd的情況下，預測一個不限數目且異質網路環境中BitTorrent系統完成下載所需要的時間。再來，我們結合了一個前人的模型，讓我們可以更進一步的預測當系統內的總上傳頻寬高於總下載頻寬時，這個系統完成的時間。以往的研究大都假設系統效能不會卡在下載頻寬上，但是在SRE機制下，系統內可能充滿大量種子，便有可能導致這個情況。最後我們針對上述情形，提出下載者可以策略性的選擇從何處下載，並以我們的模型驗證改變選擇下載來源的策略會影響系統完成的時間。 | zh_TW |
| dc.description.abstract | BitTorrent is the most widely used Peer-to-Peer file sharing protocol on the internet. It had been the largest consumer of internet traffic for years, until surpassed by Netflix in recent years. The unique mechanisms and the built-in incentives that distinguish BitTorrent from other P2P file sharing protocols result in excellent utilization and scalability, making it the top choice for file sharing communities. One of the problems of the built-in incentives is that it lacks the incentive to encourage peers to stay seeding after they finished downloading. So a lot of the communities have incorporated a mechanism called Sharing Ratio Enforcement to compensate it.
In this paper we study the impact of the SRE mechanism on the system performance of the BitTorrent systems. We derive a mathematical model that is capable of predicting the time that all peers finish downloading under a flash crowd scenario and heterogeneous network with an arbitrary number of classes of peers. Furthermore, we incorporate our model with a model from a previous work by Liao et al. to make it capable of modeling a system that the system throughput is capped on the downlink instead of the uplink. Finally we propose that the leechers can strategically select from which peers to download when there are too many seeders in the system that the uploading throughput is larger than the downloading throughput of the system. We study how this modification influences the system performance by using our model. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T17:31:45Z (GMT). No. of bitstreams: 1 ntu-101-R97725027-1.pdf: 775716 bytes, checksum: 244951aabef4dc07c4882caa03fe5e80 (MD5) Previous issue date: 2012 | en |
| dc.description.tableofcontents | 1. Introduction 1
1.1 Background 1 1.1.1 Local Rarest First, Choking Algorithm and the Built-in Incentives 2 1.1.2 The Rise of the Private Trackers 3 1.2 Motivation 3 1.3 Objectives 5 2. Related Works 6 2.1 Classic Bit-Torrent 6 2.2 Community, Private Trackers and Sharing Ratio Enforcement 11 3. Modeling 15 3.1 A Model for Sharing Ratio Enforcement 16 3.1.1 Fundamental of the model 17 3.1.2 The case of S_(dl_T2)≤S 20 3.1.3 The case of S_(dl_T2)>S 22 3.1.4 Modeling original seeders 23 3.2 Modeling Downlink Capping 24 3.2.1 Determine R_seedH and R_seedL 29 3.2.2 Capacity-based discount 30 3.2.3 Lower rate priority 30 3.2.4 Higher rate priority 31 3.2.5 Modeling original seeders 32 4. Model Analysis and Simulation Result 33 4.1 Simulator 33 4.1.1 The heuristic algorithms of bandwidth allocation 33 4.2 Analysis of the Model (Non-capping) 36 4.2.1 Breakpoints that change the slopes 37 4.3 Model Verification 41 4.4 Comparison of the Bandwidth Allocation Strategies under Downlink Capping 43 4.5 Model Verification for Downlink Capping 45 4.6 Real World Implication 46 5. Conclusion 47 5.1 Contribution 47 5.2 Future Work 48 Reference 49 | |
| dc.language.iso | en | |
| dc.subject | BitTorrent | zh_TW |
| dc.subject | 強制分享率 | zh_TW |
| dc.subject | 效能分析 | zh_TW |
| dc.subject | BitTorrent | en |
| dc.subject | Sharing Ratio Enforcement | en |
| dc.subject | Performance analysis | en |
| dc.title | 強制分享率下BitTorrent系統的效能分析 | zh_TW |
| dc.title | Performance Analysis of BitTorrent Systems with Sharing Ratio Enforcement | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 100-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 蔡益坤(Yih-Kuen Tsay),林永松(Frank Lin),周承復(Cheng-Fu Chou) | |
| dc.subject.keyword | BitTorrent,強制分享率,效能分析, | zh_TW |
| dc.subject.keyword | BitTorrent,Sharing Ratio Enforcement,Performance analysis, | en |
| dc.relation.page | 51 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2012-08-15 | |
| dc.contributor.author-college | 管理學院 | zh_TW |
| dc.contributor.author-dept | 資訊管理學研究所 | zh_TW |
| Appears in Collections: | 資訊管理學系 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| ntu-101-1.pdf Restricted Access | 757.54 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.