簡易檢索 / 詳目顯示

研究生: 陳威霖
Wei-Lin Chen
論文名稱: 基於鄰近節點資訊的點對點網路搜尋策略
Neighborhood Information Based Searching in Peer-to-Peer Networks
指導教授: 呂政修
Jenq-Shiou ,Leu
口試委員: 陳省隆
Hsing-Lung ,Chen
孫敏德
Min-Te ,Sun
鄭瑞光
Ray-Guang ,Cheng
石維寬
Wei-Kuan ,Shih
學位類別: 碩士
Master
系所名稱: 電資學院 - 電子工程系
Department of Electronic and Computer Engineering
論文出版年: 2011
畢業學年度: 99
語文別: 中文
論文頁數: 50
中文關鍵詞: 點對點網路資源搜尋隨機複製行走者
外文關鍵詞: Peer-to-Peer Networks, Resource Locating, Cloning Random Walker
相關次數: 點閱:177下載:3
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 點對點網路技術近年已被廣泛地應用於檔案分享。在點對點檔案分享中,資源搜尋(Resource Searching)是首要挑戰,包括資源搜尋時間、搜尋訊息所產生的詢息量、搜尋成功率,對於檔案分享都是重要的評估指標。既存的相關研究中,都在點對點網路中建構額外結構,輔助搜尋,本論文使用基於鄰近節點資訊的搜尋策略來取代已往額外的結構。消除額外結構後,在搜尋時間、訊息量、成功率都取得不輸以往演算法的效能,並且保持簡單維護的特性。


    Peer-to-Peer (P2P) network technology has been widely used in file sharing. In a P2P network, resource searching is the first and foremost challenge. It’s the critical indices include searching time, searching overhead, and searching success rate. Some existing works have, they established an extra structure in a P2P network, and in this paper we use neighborhood information searching algorithm without the extra structure. When we eliminated the extra structure, we will get better efficiency in searching time, searching success rate, and keep simple quality.

    論文摘要 V ABSTRACT VI 誌謝 VII 第1章 緒論 1 1.1 點對點網路相關背景簡介 1 1.2 點對點網路搜尋方法 5 1.2.1 點對點網路搜尋方法 – 泛洪演算法 7 1.2.2 點對點網路搜尋方法 – 隨機步行者 8 1.3 研究動機 9 第2章 相關工作 11 2.1 結構化點對點網路 11 2.1.1 DHT 結構化點對點網路 - Chord 11 2.1.2 DHT 結構化點對點網路 - CAN 12 2.2 非結構化點對點網路 14 2.2.1 點對點網路檔案分享系統 - Gnutella 15 2.2.2 輕量泛洪演算法 - LightFlood 17 2.2.3 基於票據的泛洪 - Ticket Based Flooding 19 2.2.4 結合支配者集合的複製型隨機步行者 - Clone Random Walker + Dominating set (CloneRW +DS) 21 第3章 基於鄰近節點資訊的搜尋策略 24 3.1 搜尋演算法主軸 24 3.2 泛洪節點選擇策略 25 3.3 複製型隨機步行者結合鄰近節點資訊搜尋演算法流程圖 30 第4章 模擬結果分析與探討 36 4.1 模擬環境及評估標準介紹 36 4.2 負擔結果 37 4.3 時間結果 39 4.4 搜尋成功率 42 4.5 不同策略比較與探討 43 第5章 結論 46 附錄 47 訊息負擔分析 47 參考文獻 49

    [1] "eMule," vol. http://www.emule-project.net.
    [2] "Bittorrent," vol. http://www.bittorrent.com/.
    [3] "Freenet," vol. http://freenetproject.org/.
    [4] "JXTA," vol. http://en.wikipedia.org/wiki/JXTA.
    [5] "Gnutella," vol. http://en.wikipedia.org/wiki/Gnutella.
    [6] Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker, "Search and replication in unstructured peer-to-peer networks," in Proceedings of the 16th international conference on Supercomputing New York, New York, USA: ACM, 2002.
    [7] Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker, "Making gnutella-like P2P systems scalable," in Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications Karlsruhe, Germany: ACM, 2003.
    [8] Song Jiang, Lei Guo, Xiaodong Zhang, and Haodong Wang, "LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search," Parallel and Distributed Systems, IEEE Transactions on, vol. 19, pp. 601-614, 2008.
    [9] Shiping Chen, Zhan Zhang, Shigang Chen, and Baile Shi, "Efficient file search in non-DHT P2P networks," Comput. Commun., vol. 31, pp. 304-317, 2008.
    [10] Hongbo Jiang and Shudong Jin, "Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks," in Proceedings of the 13TH IEEE International Conference on Network Protocols: IEEE Computer Society, 2005.
    [11] Vana Kalogeraki, Dimitrios Gunopulos, and D. Zeinalipour-Yazti, "A local search mechanism for peer-to-peer networks," in Proceedings of the eleventh international conference on Information and knowledge management McLean, Virginia, USA: ACM, 2002.
    [12] Arturo Crespo and Hector Garcia-Molina, "Routing Indices For Peer-to-Peer Systems," in Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02): IEEE Computer Society, 2002.
    [13] Jayanthi K. and Karnan M., "Implementation of an enhanced file search efficiency in P2P network," in Computational Intelligence and Computing Research (ICCIC), 2010 IEEE International Conference on, 2010, pp. 1-4.
    [14] Wei Song, Xi Zeng, Wenbin Hu, Yiting Chen, Chuanjian Wang, and F angquan Cheng, "Resource Search in Peer-to-Peer Network Based on Power Law Distribution," in Networks Security Wireless Communications and Truste ed Computing (NSWCTC), 2010 Second International Conference on, 2010,pp. 53-56.
    [15] Jenq-Shiou Leu, Cheng-Wei Tsai, and Wei-Hsiang Lin, "Resource searching in an unstructured P2P network based on Cloning Random Walker assisted by Dominating Set," Comput. Netw., vol. 55, pp. 722-733, 2011.
    [16] Yu Wang, Xinli Huang, and Qindong Lu, "Small-world-like semi-structured P2P network," in Computer Research and Development (ICCRD), 2011 3rd International Conference on, 2011, pp. 246-251.
    [17] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, and Hari Balakrishnan, "Chord: a scalable peer-to-peer lookup protocol for internet applications," IEEE/ACM Trans. Netw., vol. 11, pp. 17-32, 2003.
    [18] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker, "A scalable content-addressable network," SIGCOMM Comput. Commun. Rev., vol. 31, pp. 161-172, 2001.
    [19] Matei R., Iamnitchi A., and Foster P., "Mapping the Gnutella network," Internet Computing, IEEE, vol. 6, pp. 50-57, 2002.
    [20] Yang Lei, Yang Hao, Wang Can, and Qin Zhi-Guang, "An adaptive search method based on the interest in Gnutella-like network," in Computer Application and System Modeling (ICCASM), 2010 International Conference on, 2010, pp. V11-302-V11-306.
    [21] Chandra S. and Acosta W., "Using query transformation to improve Gnutella search performance," in Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on, 2010, pp. 1-8.
    [22] William Aiello, Fan Chung, and Linyuan Lu, "A random graph model for massive graphs," in Proceedings of the thirty-second annual ACM symposium on Theory of computing Portland, Oregon, United States: ACM, 2000.

    QR CODE