政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/134083

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/134083

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113324/144300 (79%)
造訪人次 : 51119777 線上人數 : 990

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/134083

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/134083

題名:	改良Kademlia在高度網路擾動下的搜尋成功率 Improving search success rate of Kademlia under high churn
作者:	簡豪廷 Jian, Hao-Ting
貢獻者:	蔡子傑 Tsai, Tzu-Chieh 簡豪廷 Jian, Hao-Ting
關鍵詞:	Kademlia 點對點網路擾動分散式雜湊表 Kademlia P2P churn distributed hash table
日期:	2021
上傳時間:	2021-03-02 14:31:46 (UTC+8)
摘要:	Kademlia是一種被廣泛使用的P2P分散式雜湊表技術，在高度網路擾動環境中仍存在資料搜尋失敗的問題。本文以模擬的方式對以Kademlia運作的P2P系統進行分析，整理出在Kademlia技術下資料搜尋失敗的原因，並提出改良方法以少量成本增長提升資料搜尋成功率。高度網路擾動會造成部分節點的路由表失效，同時使部份節點無法有效認識周遭節點。前者會導致儲存資料後資料難以被搜尋，或者搜尋資料時無法取得資料；後者會使資料儲存者與搜尋者找到的節點不一致，導致搜尋失敗。本文提出以紀錄長時間上線的節點，在路由表失效時向其連線以處理路由表失效的問題；及以向遠距離的節點詢問資料處理節點無法有效認識周遭節點的問題。實驗結果證實實施兩者後能使得資料搜尋成功率提升。相較於傳統上以超級節點支援的P2P網路，我們的方法能以較低的通訊成本達到相當的資料搜尋成功率。 Kademlia is a widely deployed P2P-Distributed Hash Table network, however there exists some search failure issue under high churn. This thesis analyzes the reasons for Kademlia search failure by simulating the Kademlia-based P2P system and proposed some methods to improve Kademlia search success rate with little extra cost. High churn causes Kademlia Routing Table to be invalid, and in such case, nodes would have insufficient acknowledge of surrounding nodes. Invalid Routing Tables not only make data hard to be found but also directly lead to search failure. Insufficient acknowledge of surrounding nodes would make the traversing nodes and data nodes different and cause search failure. To this end, we suggest that nodes can connect with long-stay nodes to handle the invalid Routing Table invalid problem, and nodes can ask the far nodes for information to avoid the problem for insufficient acknowledge of surrounding nodes. Simulation experiments confirm that the search success rate of Kademlia increases when the above two enhancements are implemented. Furthermore, we also compare the performance with traditional supernode supported P2P network. Simulation results also show that our method maintains the comparable search success rate but with less overhead.
參考文獻:	[1] aMule, Retrieved January 2021, from: amule.org [2] Bittorrent, Retrieved January 2021, from: https://www.bittorrent.com/ [3] D.Stutzbach and R.Rejaie. (2006). Improving Lookup Performance Over a Widely-Deployed DHT. Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications. doi:10.1109/INFOCOM.2006.329 [4] D. Stutzbach and R. Rejaie. (2006). Understanding Churn in Peer-to-Peer Networks. IMC `06: Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, 189~202. doi:10.1145/1177080.1177105 [5] Gnutella, Retrieved January 2021, from: https://en.wikipedia.org/wiki/Gnutella [6] J. Falkner, M. Piatek, J. John, A. Krishnamurthy, and T. Anderson. (2007). Profiling a Million User DHT. IMC `07: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement. doi: 10.1145/1298306.1298325 [7] Kad network, Retrieved January 2021, from: https://en.wikipedia.org/wiki/Kad_network [8] Kang H, Chan-Tin E, Hopper N, Kim Y. (2009). Why kad lookup fails. 2009 IEEE Ninth International Conference on Peer-to-Peer Computing, 121–130. doi: 10.1109/P2P.2009.5284547 [9] Liu B, Wei T, Zhang J, Li J, Zou W, Zhou M. (2012). Revisiting why kad lookup fails. 2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P), 37–42. doi: 10.1109/P2P.2012.6335808 [10] Liu Z, Yuan R, Li Z, Li H, Chen G. (2006). Survive under high churn in structured P2P systems: Evaluation and strategy. Computational Science – ICCS 2006, 404−411. doi: 10.1007/11758549_58 [11] M. Steiner, E. W. Biersack, and T. En-Najjary. (2007). Actively Monitoring Peers in KAD. IPTPS 2007. [12] Maymounkov P, Mazières D. (2002). Kademlia: a peer-to-peer information system based on the xor metric. IPTPS `01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp 53–65. [13] O. Herrera and T. Znati. (2007). Modeling Churn in P2P Networks. 40th Annual Simulation Symposium (ANSS`07). doi: 10.1109/ANSS.2007.28 [14] Official eMule-Board, Retrieved January 2021, from: forum.emule-project.net
描述:	碩士國立政治大學資訊科學系 107753026
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0107753026
資料類型:	thesis
DOI:	10.6814/NCCU202100314
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
302601.pdf		2028Kb	Adobe PDF2	0	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回饋