| dc.contributor.advisor | 蔡子傑 | zh_TW |
| dc.contributor.advisor | Tsai, Tzu-Chieh | en_US |
| dc.contributor.author (Authors) | 簡豪廷 | zh_TW |
| dc.contributor.author (Authors) | Jian, Hao-Ting | en_US |
| dc.creator (作者) | 簡豪廷 | zh_TW |
| dc.creator (作者) | Jian, Hao-Ting | en_US |
| dc.date (日期) | 2021 | en_US |
| dc.date.accessioned | 2-Mar-2021 14:31:46 (UTC+8) | - |
| dc.date.available | 2-Mar-2021 14:31:46 (UTC+8) | - |
| dc.date.issued (上傳時間) | 2-Mar-2021 14:31:46 (UTC+8) | - |
| dc.identifier (Other Identifiers) | G0107753026 | en_US |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/134083 | - |
| dc.description (描述) | 碩士 | zh_TW |
| dc.description (描述) | 國立政治大學 | zh_TW |
| dc.description (描述) | 資訊科學系 | zh_TW |
| dc.description (描述) | 107753026 | zh_TW |
| dc.description.abstract (摘要) | Kademlia是一種被廣泛使用的P2P分散式雜湊表技術，在高度網路擾動環境中仍存在資料搜尋失敗的問題。本文以模擬的方式對以Kademlia運作的P2P系統進行分析，整理出在Kademlia技術下資料搜尋失敗的原因，並提出改良方法以少量成本增長提升資料搜尋成功率。高度網路擾動會造成部分節點的路由表失效，同時使部份節點無法有效認識周遭節點。前者會導致儲存資料後資料難以被搜尋，或者搜尋資料時無法取得資料；後者會使資料儲存者與搜尋者找到的節點不一致，導致搜尋失敗。本文提出以紀錄長時間上線的節點，在路由表失效時向其連線以處理路由表失效的問題；及以向遠距離的節點詢問資料處理節點無法有效認識周遭節點的問題。實驗結果證實實施兩者後能使得資料搜尋成功率提升。相較於傳統上以超級節點支援的P2P網路，我們的方法能以較低的通訊成本達到相當的資料搜尋成功率。 | zh_TW |
| dc.description.abstract (摘要) | 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. | en_US |
| dc.description.tableofcontents | 第一章 緒論 1第一節 背景與動機 1第二節 研究目的 3第二章 文獻探討 4第一節 Kademlia 4第二節 Kademlia搜尋成功率 16第三節 網路擾動 20第三章 研究方法 22第一節 依距離分析Kademlia搜尋失敗情境 22第二節 模擬方法及環境 24第三節 初步改良方式及其實驗結果分析 26第四節 Kademlia搜尋失敗原因 30第五節 改良方法 32第六節 Kademlia搜尋失敗原因及改良方法統整 34第四章 實驗結果與分析 35第一節 將改良方法與Kademlia進行比較 35第二節 將改良方法與其他方法進行比較 38第三節 其他調整方式及其實驗結果 44第五章 結論與未來展望 48第一節 結論 48第二節 未來展望 49參考文獻 50 | zh_TW |
| dc.format.extent | 2076822 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.source.uri (資料來源) | http://thesis.lib.nccu.edu.tw/record/#G0107753026 | en_US |
| dc.subject (關鍵詞) | Kademlia | zh_TW |
| dc.subject (關鍵詞) | 點對點 | zh_TW |
| dc.subject (關鍵詞) | 網路擾動 | zh_TW |
| dc.subject (關鍵詞) | 分散式雜湊表 | zh_TW |
| dc.subject (關鍵詞) | Kademlia | en_US |
| dc.subject (關鍵詞) | P2P | en_US |
| dc.subject (關鍵詞) | churn | en_US |
| dc.subject (關鍵詞) | distributed hash table | en_US |
| dc.title (題名) | 改良Kademlia在高度網路擾動下的搜尋成功率 | zh_TW |
| dc.title (題名) | Improving search success rate of Kademlia under high churn | en_US |
| dc.type (資料類型) | thesis | en_US |
| dc.relation.reference (參考文獻) | [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 | zh_TW |
| dc.identifier.doi (DOI) | 10.6814/NCCU202100314 | en_US |
