應用於BT同儕通訊的通透閘道快取

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：44

、訪客IP：3.139.69.17

姓名

陳宜凡(Yi-Fan Chen) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

應用於BT同儕通訊的通透閘道快取
(A Tansparent and Gated cache for BT-P2P communication)

相關論文

★ 整合多樣配置組態下的藍芽射頻驗證系統	★ 具檔案敘述相關語查詢之智慧型檔案搜尋系統
★ 具遲到者支援功能之網際網路簡報系統	★ 以快速廣播法建構熱門視訊隨選服務伺服器
★ 具事件同步再現特性之遠程電傳展示伺服器	★ 無線網路環境下之廣播資訊快速下載
★ 中文網站繁簡互訪協助系統	★ 支援時光平移播放之調適性現場直播演算法
★ 用於互動式廣播之段落對齊法	★ 熱門影片廣播法之影片區段復原機制
★ 配合熱門影片廣播的本地伺服器高效快取法	★ 一個增進SIP在防火牆環境中應用的協同模組
★ 考量網頁熱門度之一致性雜湊法解決網頁代理伺服器之負載平衡	★ 以網域名稱伺服器為基礎之色情網站過濾系統
★ 使用熱門廣播法及支援點對點傳輸之影音內容傳遞網路	★ 變動頻寬平滑化之熱門廣播演算法

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

隨著個人電腦功能不斷地提升，現今個人電腦的能力已可比擬工作站之能力。而大眾之網路頻寬隨著如非對稱數位用戶專線、纜線數據機的出現，頻寬的提升使得個人用戶也有足夠的能力分享資訊於網際網路。同儕網路 (Peer-to-Peer Network) 的架構便因此而發展，使得網路上個別用戶均能提供一己之資源，如運算能力、檔案分享、儲存空間、網路能力。而同儕網路的蓬勃應用，其流量也已成為WWW資訊散佈外的最大宗。然而同儕網路中使用者之間直接的資料傳輸，與底層的拓撲並不相符，在路由器之間造成了重複的流量，降低了頻寬的使用效率。本論文主要分析，如何讓區域網路的使用者能夠彼此優先分享檔案，從而減少頻寬的浪費，使用者也能得到快速下載的的服務品質。
同儕網路的使用者分享資源所默認聆聽的服務埠號也如同提供服務的使用者之變動性一般無法預期，無所謂公開服務埠號。本文提出藉由在區域網路中設置一台通透的網路代理伺服器，讓使用者取得修改過之Metainfo檔案，而連上內部所設置的一台BitTorrent Tracker，由內部此台Tracker告知使用者快取的位址而可以向快取下載檔案，並且區域網路中有相同檔案下載請求的使用者也能透過內部的Tracker彼此優先分享檔案，而不需連至外部網際網路的使用者索取檔案。

摘要(英)

With the improvement of personal computers (PCs), they almost perform as well as workstations. New network technologies such as asymmetric digital subscriber line (ADSL) and cable modem make users share their resources with each other. Furthermore, the peer-to-peer network (P2P) technology allows users to share their computing power, disk spaces, and bandwidth on the overlay network. However, the P2P is usually built on the application layer of the OSI model. Thus, its messaging path is independent of real network routing. Such operation makes redundant traffic flow seriously. To alleviate the problem, we propose an approach, which forces all peers to download files from their local peers, if they are available. Further, we apply our approach to the BitTorrent, which is a very popular p2p system. We use a transparent proxy to hijack a metainfo file downloaded by a user from a Web server. Then, the original tracker of the metainfo is replaced by a new one. The user therefore connects to the local BitTorrent tracker, which directs the user to other local peers with desired files. Thus, the bandwidth consumption on WAN caused by BitTorrent will be reduced.

關鍵字(中)

★ 快取
★ 同儕網路
★ 網路代理伺服器
★ 防火牆
★ BitTorrent

關鍵字(英)

★ Firewall
★ Cache
★ proxy server
★ BitTorrent
★ Peer-to-Peer

論文目次

摘要 i
目錄 iii
圖目錄 v
表目錄 ix
第1章緒論 1
第2章相關研究 4
2.1 近端查找策略 4
2.2 同儕網路快取 6
第3章系統設計 18
3.1 BitTorrent 18
3.2 方法分析 20
3.2.1 導向分析 21
3.2.2 內部BT攔截分析 23
3.3 系統說明 24
3.4 系統模組 28
第4章系統實作及測試 31
4.1 實作環境 31
4.2 使用流程 32
第5章結論及未來工作 38
參考文獻 39

參考文獻

[1] Napster, http://www.napster.com/
[2] Gnutella 0.6 protocol draft, http://rfc-gnutella.sourceforge.net/, 2002.
[3] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for internet applications,” in Proceedings of ACM SIGCOMM , San Diego, August 2001, pp. 160–177
[4] F. Dabek, E. Brunskill, M. Frans Kaashoek, D. Karger, R. Morris, I. Stoica, and H. Balakrishnan., “Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service,” 8th Workshop on Hot Topics in Operating Systems, Germany, May 2001.
[5] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” in Proceedings of ACM SIGCOMM, San Diego, August 2001, pp. 149–160
[6] B. Y. Zhao, J. Kubiatowicz and A. Joseph, “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,” UCB Tech. Report UCB/CSD-01-1141
[7] B. Y. Zhao, Y. Duan, L. Huang, A. D. Joseph and J. D. Kubiatowicz, “Brocade: landmark routing on overlay networks,” First International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA. March 2002.
[8] B. Y. Zhao, A. D. Joseph, and J. D. Kubiatowicz, “Locality-aware Mechanisms for Large-scale Networks, ” Workshop on Future Directions in Distributed Computing Bertinoro, Italy, June 2002
[9] P. Ganesan, Q. Sun, and H. Garcia-Molina, “YAPPERS: A Peer-to-Peer Lookup Service Over Arbitrary Topology,” INFOCOM, 2003.
[10] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Systems,” ICDCS, 2002.
[11] P. Druschel and A. Rowstron, "PAST: A large-scale, persistent peer-to-peer storage utility," HotOS VIII, Schoss Elmau, Germany, May 2001.
[12] A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, pages 329-350, November 2001.
[13] Stefan Saroiu, Krishna P. Gummadi, Richard j. Dunn, Steven D. Gribble, and Hebnry M. Levy, “Analysis of Internet Content Delivery Systems” In. Proc. of OSDI '02, 2002.
[14] Bittorrent, http://www.bittorrent.com/protocol.html/
[15] BramCohen, “Incentives Build Robustness in BitTorrent”, Workshop on Economics of Peer-to-Peer Systems, May 22 2003
[16] AsfandyarQureshi, “Exploring Proximity Based Peer Selection in a BitTorrent-like Protocol”, MIT 6.824. student project, May7,2004
[17] R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris,“Practical, distributed network coordinates," in Proceedings of the Second Workshop on Hot Topics in Networks (HotNets-II), (Cambridge, Massachusetts), ACM SIGCOMM, November 2003.
[18] L. Li, J. Halpern, and Z. Haas, “Gossip-based ad hoc routing." citeseer.ist.psu.edu/haas01gossipbased.html.
[19] V. N. Padmanabhan and L. Subramanian, “An investigation of geographic mapping techniques for internet hosts," Proceedings of SIGCOMM'2001, p. 13, 2001.
[20] Sitaram Iyer Antony Rowstron Peter Druschel, “Squirrel：A decentralized peer-to-peer webcache,” the 21th ACM Symposium on Principles of Distributed Computing , July 2002
[21] JXTA, http://www.jxta.org/
[22] M. Repeanu, I. Foster, and A. Iamnitchi, Mapping the gnutella network: Properties of learge-scale peer-to-peer systems and implications for system design,” IEEE Internet Computing Journal, 6(1), 2002.
[23] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proceedings of the 16th ACM International Conference on Supercomputing, 2002.
[24] The popularity of Gnutella queries and its implications on scalability, http://www2.cs.cmu.edu/~kunwadee/research/p2p/gnutella.
[25] S. Patro and Y. C. Hu, "Transparent Query Caching in Peer-to-Peer Overlay Networks," in Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS), 2003.
[26] Chen Wang, Li Xiao, Yunhao Liu, and Pei Zheng, “Distributed Caching and Adaptive Search in Multilayer P2P Networks,” in Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS’04), 2004
[27] 郭廖軒, “以網域名稱伺服器為基礎之色情網站過濾系統,” TANET 2004
[28] “Internet2:Netflowweeklyreports.”Http://netflow.internet2.edu/weekly/20031117/
[29] 謝民一，”複製可追查型CDN-P2P遞送網路下之近端伺服器選擇,” Journal of Internet technology, vol. 6, 2004。
[30] L7-filter, http://l7-filter.sourceforge.net/protocols
[31] 吳俊德，”具額外快取之飲片快取替換,” TANET 2004
[32] Adam Wierzbicki, Nathaniel Leibowitz, Matei Ripeanu, and Rafał Woźniak, ” Cache Replacement Policies Revisited: The Case of P2P Traffic,” 4th GP2P Workshop, April 2004, Chicago, IL

指導教授

曾黎明(Li-Ming Tseng)

審核日期

2005-7-22

推文