現在位置首頁 > 博碩士論文 > 詳目
  • 同意授權
論文中文名稱:同儕式結構化網路的快取策略 [以論文名稱查詢館藏系統]
論文英文名稱:An Efficient Cache Strategy in Structured Peer-to-Peer Networks [以論文名稱查詢館藏系統]
院校名稱:臺北科技大學
學院名稱:管理學院
系所名稱:資訊與運籌管理研究所
畢業學年度:99
出版年度:100
中文姓名:周信屹
英文姓名:Shin-Yi Chou
研究生學號:98938012
學位類別:碩士
語文別:中文
口試日期:2011-06-23
論文頁數:23
指導教授中文名:陳育威
指導教授英文名:Yu-Wei Chen
口試委員中文名:黃其彥;陳德釧
口試委員英文名:Chi-Yan Huang;De-Chuan Chen
中文關鍵詞:同儕式結構化網路快取
英文關鍵詞:peer-to-peer networkstructuredcache
論文中文摘要:在P2P搜尋策略中,最基本的想法是將工作分配給在系統中的各節點,以降低整個系統的負擔。在這篇論文當中,我們提出一種運用於分散式結構化P2P系統的Cache策略。在分散式結構化P2P系統環境的搜尋過程中,將每一個節點設置一個Cache清單,藉由Cache 清單儲存的該節點使用者過去的使用經驗,優先搜尋存放在Cache 快取的節點。以加快在分散式結構化P2P系統中的搜尋速度以及搜尋的命中率。
論文英文摘要:In this thesis, we propose a cache strategy which is suitable for decentralized structure peer-to-peer networks. In our cache strategy, each peer will maintain a list regarding the previous search results. Each peer can reduce the research times by exploring its list. The simulation experiments on the Cache Strategy show that the cache hit ratio is the proposed strategy is up to 40%.
論文目次:摘要...............................I
ABSTRACT..........................II
誌謝.............................III
目錄..............................IV
圖目錄.............................V
第一章 緒論.......................1
1.1 P2P近代發展 ...................1
1.2 P2P架構分類 ...................1
1.3 研究動機與目的.................3
第二章 文獻探討....................5
2.1 結構化系統架構改善.............5
2.2 Cache策略的相關研究............5
第三章 方法介紹....................7
3.1 節點定義.......................7
3.2 Cache清單......................8
3.3節點加入與離開..................9
3.4 搜尋協定.......................9
3.5 Cache策略與結構化系統.........13
第四章 實驗結果...................15
第五章 結論.......................21
參考文獻..........................22
論文參考文獻:[1] I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan, “Chord: a scalable peer-to-peer lookup service for Internet applications,” Proc. ACM SIGCOMM, 2001.
[2] B. Y. Zhao. J. Kubiatowicz, and A. D. Joseph. “Tapestry: a fault-tolerant wide-area application infrastructure.” Computer Communication, vol. 32, 2002.
[3] A. I. T. Rowstron and P. Druschel. “Pastry: scalable decentralized object location, and routing for large-scale peer-to-peer storage utility.” In SOSP, 2001.
[4] S. Ratnasamy, P. Francis, M. Handley, R. M. Karp, and S. Shenker.
“A scalable content-addressable network.” In SIGCOMM, 2001.
[5] The Naspter homepage, http://www,napster.com.
[6] Clip2.com, The Gnutella Protocol Specification V0.4, http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf, Mar. 2001.
[7] M. S. Chen, P. S. Yu, and K. L. Wu, “Optimal NODUP all-to-all broadcasting schemes in distributed computing systems,” IEEE Trans. Parallel and
Distributed Systems, vol. 5, no. 12, pp. 1275-1285, 1994.
[8] E. Cohen, A. Fiat, and H. Kaplan, “Associative search in peer to peer networks: harnessing latent semantics,” Proc. IEEE INFOCOM ’03, 2003.
[9] Q. Liv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer network, ” Proc. ACM SIGMETRIC ’02, 2002.
[10] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient content location using interest-based locality in peer-to-peer systems,” Proc. IEEE INFOCOM ’03, 2003.
[11] N. Leibowitz, A. Bergman, R. Ben-Shaul, and A. Shavit, “Are file swapping networks cacheable? characterizing P2P traffic,”Proc. Int’l Workshop Web Content Caching and Distribution (WCW ‘02), Aug. 2002.
[12] T. Karagiannis, P. Rodriguez, and K. Papagiannaki, “Should Internet Service Providers fear peer-assisted content distribution?” Proc. ACM Conf. Internet Measurement (IMC ‘05), pp. 63-76, Oct. 2005.
[13] A. Wierzbicki, N. Leibowitz, M. Ripeanu, and R. Wozniak, “Cache replacement policies revisited: The case of P2P traffic,” Proc. Int’l Workshop Global and Peer-to-Peer Computing (GP2P ‘04), pp. 182-189, Apr. 2004.
[14] K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan, “Measurement, modeling, and analysis of a peer-to-peer file-sharing workload,”Proc. ACM Symp. Operating Systems Principles (SOSP ‘03), pp. 314-329, Oct. 2003.
[15] S. Sen and J. Wang, “Analyzing peer-to-peer traffic across large networks,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219-232, Apr. 2004.
[16] F. Dabek, M. F. Kaashoek, D. R. Karger, R. Morris, and I. Stoica. “Wide-area cooperative storage with CFS.” In SOAP, 2001.
[17] A. I. T. Rowstron and P. Druschel. “Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility.” In SOSP, 2001.
[18] M. Yang and Y. Yang, “An efficient hybrid peer-to-peer system for distributed data sharing,” IEEE Trans. ON COMPUTERS, vol, 59, no. 9, pp.1-10, Sep. 2010.
[19] http://en.wikipedia.org/.
論文全文使用權限:同意授權於2013-07-29起公開