請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36273
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 莊裕澤(Yuh-Jzer Joung) | |
dc.contributor.author | Hsiu-Lin Huang | en |
dc.contributor.author | 黃琇琳 | zh_TW |
dc.date.accessioned | 2021-06-13T07:55:33Z | - |
dc.date.available | 2011-08-05 | |
dc.date.copyright | 2011-08-05 | |
dc.date.issued | 2011 | |
dc.date.submitted | 2011-07-21 | |
dc.identifier.citation | [1]
'BitTorrent,' http://bittorrent.com [2] 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, pp. 1-12 (Apr. 2006) [3] 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) [4] A Legout, N Liogkas, et.al. 'Clustering and Sharing Incentives in BitTorrent Systems', in Proc. of ACM SIGMETRICS 2007, San Diego, CA, USA, pp. 301-312 (June. 2007) [5] A. Legout, G. Urvoy-Keller, and P. Michiardi, 'Understanding BitTorrent: An Experimental perspective', Technical Report, INRIA, Sophia Antipolis, France (Nov. 2005) [6] AA Hamra, N Liogkas, A Legout, 'Swarming Overlay Construction Strategies', in Proc. of International Conference on Computer Communications and Networks 2009 (ICCCN), San Francisco, CA, USA, pp. 1-6 (Aug. 2009) [7] ALH Chow, L Golubchik, et.al., 'BitTorrent: An Extensible Heterogeneous Model', in Proc. of Annual Joint Conference of the IEEE Computer and Communications Societies (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 Fan, JCS Lui, DM Chiu, 'The design trade-offs of BitTorrent-like file sharing protocols', in Proc. of IEEE/ACM Transactions on Networking (TON) 2009, NJ, USA, Vol. 17, No. 2, pp 365-376 (Apr. 2009) [10] D Levin, K LaCurts, et.al. '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) [11] G Urvoy-Keller, P Michiardi , 'Impact of Inner Parameters and Overlay Structure on the Performance of BitTorrent', in Proc. of 25th IEEE International Conference on Computer Communications (IEEE INFOCOM), Barcelona, Spain, pp. 1-6 (Apr. 2006) [12] M Meulpolder, 'Modeling and Analysis of Bandwidth-Inhomogeneous Swarms in BitTorrent', in Proc. of IEEE 9th International Conference on Peer-to-Peer Computing (P2P 2009), Seattle, WA, pp. 232-241 (Sept. 2009) [13] 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, pp. 1-11 (Apr. 2004) [14] R Thommes, M Coates, 'BitTorrent Fairness: Analysis and Improvements', in Proc. of Workshop Internet, Telecom. and Signal Proc., Noosa, Australia (Dec. 2005) [15] S Saroiu, PK Gummadi, SD Gribble, 'A Measurement Study of Peer-to-Peer File Sharing Systems', in Proc. of Multimedia Computing and Networking (MMCN), San Jose, CA, USA, pp. 156-170 (Jan. 2002) [16] W Liu, D Peng, et.al. 'Enhancing tit-for-tat for incentive in BitTorrent networks', Peer-to-Peer Networking and Applications, Vol. 3, No. 1, pp. 27-35 (Mar. 2010) [17] WC 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] 'Azureus,' http://sourceforge.net/projects/azureus/ [19] 'IPOQUE, Internet Study 2008/2009,' http://www.ipoque.com/resources/internet-studies/internet-study-2008_2009 [20] Z Zhang, Y Li, Y Chen, et.al., 'Understand the Unfairness of BitTorrent', in the Poster session of ACM SIGCOMM 2009, Barcelona, Spain (Aug. 2009) [21] J.A. Pouwelse, P. Garbacki, D.H.J. Epema, and H.J. Sips, 'A Measurement Study of the BitTorrent Peer-to-Peer File-Sharing System', Technical Report, Delft University of Technology, The Netherlands. (Apr. 2004) [22] D.Qiu and R. Srikant, 'Modeling and Performance Analysis of BitTorrent-like Peer-to-Peer Networks', in Proc. of SIGCOMM 2004, Portland, Oregon, USA, pp 367-378 (Aug. 2004) [23] A. Al Hamra, A. Legout, and C. Barakat, 'Understanding the properties of the Bittorrent Overlay', Technical Report, Inria (July. 2007) [24] 'Floyd-Warshall Algorithm,' http://en.wikipedia.org/wiki/Floyd–Warshall_algorithm [25] Bharambe, A. and Herley, C. and Padmanabhan, V.N., 'Microsoft Research Simulator for the BitTorrent Protocol,' http://www.research.microsoft.com/projects/btsim | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/36273 | - |
dc.description.abstract | BitTorrent(BT)為目前網際網路中使用廣泛的應用程式,曾有統計指出網路網路頻寬佔用的三分之一來自於BitTorrent,這樣的成功主要導因於其傳輸大型檔案的簡單運作機制,以及在選擇上傳對象(peer choking)及選擇上傳檔案piece(piece selection)機制上的高效率。然而,在BitTorrent系統中,這些機制皆運作於所建構的覆蓋網路之上,因此,建構及維護覆蓋網路策略亦變得相當重要。
在本篇論文中,我們將覆蓋網路建構過程分為三階段:最初peer set的選擇、peer set的更新、連結的管理,分別代表一個peer如何在一開始時獲得其他peer清單以建立連結,並如何在過程中更新該清單和管理已建立的連結。在每一個階段,都有不同的設計選擇。例如,在組成peer清單時,可以隨機選擇peer或是依照頻寬來選擇適合的peer;在更新peer清單時,peer可以選擇從centralized tracker中獲得,亦可由其他peer手中分散式的取得;而在管理連結時,peer可以選擇忠於維持已建立的連結直到連結中斷為止,亦可以在有更好的peer可以選擇時,取代已建立的連結。除此之外,peer清單的大小規模以及peer在建立連結時採主動或被動態度也都會影響覆蓋網路的結構。總合來說,在建立及維護覆蓋網路上存在許多不同策略,而本篇論文即針對這些策略對BitTorrent的影響進行研究,並找出能夠協助改進BitTorrent效能的關鍵覆蓋網路建置因素。 | zh_TW |
dc.description.abstract | BitTorrent is one of the most important applications in the Internet. Some statistics have shown that it has accounted for more than 1/3 of the Internet bandwidth. Part of BitTorrent’s immense success may be attributed to its simple design, and the effectiveness of its peer choking and piece selection mechanisms for distributing large files over the Internet. As these mechanisms are to be performed on the application overlay, how the overlay is constructed and maintained is crucial to their performance.
In this paper we divide the overlay construction process into three stages: initial peer set selection, peer set update, and connection management, representing how a peer obtains an initial list of peers in the overlay, how it updates the list, and how it maintains its overlay links. In each stage, there are several design choices. For example, random selection or bandwidth match can be used to compose a peer list; a peer can update its peer list from its overlay neighbors or from a centralized tracker; and a peer may stick to a neighbor until their link is broken, or replace it when it sees a “better” peer. Besides, the size of the peer list, and whether a peer should be more aggressively using the list to establish neighbor connections, or passively waiting for other peers to establish connections also affect the overlay structure. In total, many combinations are possible to build and maintain an overlay. The purpose of the paper is to sort out them and find the key choices that help improve the performance. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T07:55:33Z (GMT). No. of bitstreams: 1 ntu-100-R97725022-1.pdf: 3188368 bytes, checksum: b8abeed77fb22c1670aa32b75a911a62 (MD5) Previous issue date: 2011 | en |
dc.description.tableofcontents | 1. Introduction 1
1.1 Background 1 1.2 Motivation 3 1.3 Research Objectives 7 2 Related Works 8 2.1 BitTorrent performance 8 2.2 Overlay construction strategy in BitTorrent protocol 11 2.3 Other overlay construction strategies 13 3. Methodology 16 3.1 Mechanisms in overlay construction process 16 3.2 Experiment design 19 3.3 Experiment setup 20 3.4 Experiment configuration 21 3.5 Evaluation metric 24 4. Simulation Result 26 4.1 Tracker side - Peer Selection mechanism 26 4.2 Peer side - Connections Update mechanism 41 4.3 Peer side - Connections Management mechanism 47 4.4 Impact of key parameters 53 4.5 Impact of environmental factors 62 5. Conclusion 69 5.1 Contribution 69 5.2 Future Work 70 6. Reference 72 7. Appendix 75 | |
dc.language.iso | en | |
dc.title | BitTorrent系統中覆蓋網路建構策略影響之研究 | zh_TW |
dc.title | A comprehensive study of overlay construction strategies in BitTorrent | en |
dc.type | Thesis | |
dc.date.schoolyear | 99-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 林永松,周承復(Cheng-Fu Chou),邱舉明(Ge-Ming Chiu) | |
dc.subject.keyword | 覆蓋網路建構策略,拓樸分析,效能分析, | zh_TW |
dc.subject.keyword | BitTorrent,Overlay construction strategy,Topology analysis,Performance analysis, | en |
dc.relation.page | 89 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2011-07-21 | |
dc.contributor.author-college | 管理學院 | zh_TW |
dc.contributor.author-dept | 資訊管理學研究所 | zh_TW |
顯示於系所單位: | 資訊管理學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-100-1.pdf 目前未授權公開取用 | 3.11 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。