Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28736
Title: | 考慮地域性之階層式加入方法:考慮鄰近性的點對點網路系統 Hierarchical Proximity Join:A Proximity-Aware Peer-to-Peer System |
Authors: | Man-Ling Hung 洪曼玲 |
Advisor: | 莊裕澤(Yuh-Jzer Joung) |
Keyword: | 點對點系統,地域鄰近性,Gnutella,拓樸失調, Peer-to-Peer,proximity,Gnutella,topology mismatch, |
Publication Year : | 2007 |
Degree: | 碩士 |
Abstract: | 由於點在加入P2P網路時,往往都不會考慮到下層的實體網路拓墣,因此導致拓樸失調問題(topology mismatch problem),許多學者致力於研究路由(routing)跟搜尋(search)的機制來提高P2P的整體效能,但也因為拓樸失調的問題,使得他們所提出的改善方法因此大打了折扣。拓樸失調不僅會帶來許多不必要的訊息量,也會讓訊息的回覆時間增加,在P2P的網路中,回應的時間是使用者比較關心的議題。
因此為了解決拓樸失調的問題,本研究以Gutella網路為底層,提出了一個階層式加入方法(Hierarchical Proximity Join, HPJ),是在節點加入網路的時候考慮到鄰近性問題,讓節點可以加入在實體網路中確實離自己比較近的地方,每個網路中的節點都會記錄一個階層式的相鄰節點表(Hierarchical Neighbor Table),新加入的點會利用這個表來找到最適合加入的節點,讓上層的P2P覆蓋網路能夠與下層實體網路更接近。我們的實驗也證明了HPJ確實可以讓覆蓋網路與實體網路之間的差異變小,且在可以接受的搜尋成功率下,也讓搜尋的回應時間縮短許多,因此解決的拓樸失調的問題。 P2P (Peer-to-Peer) file sharing, which is one of the most popular applications, has recently gained significant attention in both academic and industrial areas. However, in most P2P systems, the overlay network is built independent of the physical network. The topology mismatch problem greatly limits the system performance. In this paper, we proposed a hierarchical proximity join(HPJ) mechanism based on Gnutella P2P system and aiming at alleviating the mismatch problem. The mechanism is adopted when peers joining and makes the overlay network be more close to the physical topology. A new peer gets proximity information from some active peers in the network. Our studies tells that HPJ alleviates the mismatch problem and shortens search response time. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28736 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 資訊管理學系 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-96-1.pdf Restricted Access | 712.99 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.