跳到主要內容

臺灣博碩士論文加值系統

(18.205.192.201) 您好!臺灣時間:2021/08/05 10:37
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:蕭鴻益
研究生(外文):Hung-Yi Shiau
論文名稱:一個基於使用DHT廣播搜尋的拓樸感知P2P網路演算法
論文名稱(外文):Topology Aware P2P by Using DHT-based Flooding Approach
指導教授:王丕中
學位類別:碩士
校院名稱:國立中興大學
系所名稱:資訊科學與工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
畢業學年度:96
語文別:中文
論文頁數:46
中文關鍵詞:結構化系統拓樸感知地理位置分群廣播
外文關鍵詞:DHT-based systemtopology-awarenesstopologically groupingFlooding
相關次數:
  • 被引用被引用:0
  • 點閱點閱:321
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
點對點(Peer to Peerr)網路是近年來很熱門的技術,用以解決傳統主從式架構因提供服務所帶來的負載很重的問題。在DHT-based結構化系統中,可以使用完整的檔名精確的找到所想要的檔案或資源,但對於相關字部分的查詢,僅能透過非結構化系統(Flooding)的方法來進行相關字查找。近年來在眾多的點對點網路研究中,已有學者在使用支援相關字查找的結構化系統架構方面陸續提出方法。但由於點對點網路為一重疊網路,建立在實體網路之上,因此會有拓樸錯誤匹配問題。
本篇論文最主要就是利用一個拓樸感知的方法依節點之間地理鄰近性分群後所形成的階層式結構化系統,並使用DHT-based的結構化之點對點網路的廣播(Flooding)方法同時對不同群組進行廣播查找資源,以期降低搜尋時所花費的延遲時間。
最後我們使用OverSim點對點模擬軟體去驗證我們所提出的方法,在結構化架構中去比較未使用分群及分群後的架構,可以看出分群後的搜尋所付出的延遲時間較少。因此運用我們方法來進行資源或者有關相關字搜尋的查找,可以減少搜尋所付出的時間。
P2P network is very popular in recent years, to resolve the traditional client server system in the provision of services brought about by the problem of heavy load. DHT-based systems les excel at supporting exact-match lookup; however, these systems do not support keyword-search. In contrast, unstructured P2P systems, like Guntella, support keyword-search, but the flooding-based algorithm does not scale. Moreover, P2P network is an overlay network which has been established over underlay network, so there is “Topology mismatch” problem.

In this paper, we propose a topology-awareness P2P scheme to relieve the problem of topology mismatch. It can improve the performance of system broadcasting and decrease search latency. In this system, we categorize the topologically adjacent peers into one P2P group and use DHT-based flooding approach to broadcast query messages to the other group simultaneously to decrease the search latency. Finally, we evaluate the performance for our approach by Oversim simulator. The experimental results show that our approach can improve broadcasting performance and reduce search latency.
中文摘要...................................................i
Abstract..................................................ii
目錄.....................................................iii
圖目錄.....................................................v
表目錄...................................................vii
第一章 緒論...............................................1
一、 P2P的背景..........................................1
二、 問題描述...........................................4
三、 論文貢獻...........................................6
四、 論文架構...........................................6
第二章 相關研究...........................................7
一、 結構化系統方面的搜尋方法...........................7
(一) Chord...........................................7
(二) HIERAS.........................................13
二、 非結構化系統方面的搜尋方法........................16
(一) Gnutella.......................................16
(二) Modified-BFS...................................18
(三) Random walk....................................18
三、 在結構化系統使用Flooding方法......................19
第三章 設計方法..........................................22
一、 研究動機及目的....................................22
二、 階層式DHT-based的架構.............................22
(一) 分群方法.......................................24
(二) 資料結構.......................................25
(三) 節點的運作.....................................27
三、 分段式遞回搜尋法(Recursive Partition Search)......28
四、 蒐集群組資訊......................................33
五、 在階層式DHT-based P2P網路使用Flooding的機制.......36
(一) 階層式DHT-based P2P網路使用Flooding的流程......36
第四章 實驗及結果........................................39
一、 實驗環境..........................................39
二、 實驗結果與分析....................................40
第五章 結論..............................................44
參考文獻..................................................45
[1] Stoica, R. Morris, D. Karger, E Kaashoek and H. Balakrishnan.“Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,”in Proc. of ACM SIGCOMM ‘OI, 2001.
[2] A. Rowstron, P. Druschel,“Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” in IFIP/ACM International Conference on Distributed System Platform ( Middle-ware), 2001.
[3] Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham and Scott Shenker”Making Gnutella-like P2P Systems Scalable,”in Proc. of ACM SIGCOMM, August 25-29, 2003
[4] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti,“A Local Search Mechanism for Peer-to-Peer Networks”, In Proc. of CIKM, 2002.
[5] C. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker.“Search and Replication in Unstructured Peer-to-Peer Networks.” In Proc. of ICS, 2002.
[6] Sylvia Ratnasamy, Mark Handley, Richard Karp and Scott Shenker,“Topologically-Aware Overlay Construction and Server Selection”,in Proc. of IEEE INFOCOM 2002
[7] Zhiyon Xu, Rui Min and Yiming Hu,”HIERAS: A DHT Based Hierarchical P2P Routing Algorithm”, in Proc. of the 2003 International Conference on Parallel Processing (ICPP’03)
[8] Vladimir Vishnevsky, Alexander Safonov, Mikhail Yakimov,”Scalable Blind Search and Broadcasting in Peer-to-Peer Networks” in Proc. of the Sixth IEEE International Conference on Peer-to-Peer Computing(P2P.06)
[9] S. El-Ansary, L.O. Alima, P. Brand, S. Haridi,“Efficient Broadcast in Structured P2P Networks”.Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, 2003
[10] Vladimir Vishnevsky, Alexander Safonov, Mikhail Yakimov,” Scalable Blind Search and Broadcasting in Peer-to-Peer Networks”,in Proc. of the Sixth IEEE International Conference on Peer-to-Peer Computing (P2P''06)
[11] Yunhao Liu, Member, IEEE, Li Xiao, Member, IEEE, Xiaomei Liu,Lionel M. Ni, Fellow, IEEE, and Xiaodong Zhang, Senior Member, IEEE, “Location Awareness in Unstructure Peer-to-Peer System”, in Proc. of IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 16, NO. 2, FEBRUARY 2005
[12] Ingmar Baumgart, Bernhard Heep, Stephan Krause,”Oversim:A Flexible Overlay Network Simulation Framework”, in Proc. of IEEE 2007
[13] STEPHANOS ANDROUTSELLIS-THEOTOKIS AND DIOMIDIS SPINELLIS,”A Survey of Peer-to-Peer Content Distribution Technologies”,ACM Computing Surveys, Vol. 36, No 4, December 2004,pp. 335-371.
[14] Oversim website, http://www.oversim.org/
[15] Omnet++, http://www.omnetpp.org/
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top