本文選題：對等網(wǎng)絡(luò) + 資源搜索機(jī)制��； 參考：《北京交通大學(xué)》2015年碩士論文

【摘要】：近年來,P2P網(wǎng)絡(luò)(Peer-to-Peer,簡稱P2P)一種分布式網(wǎng)絡(luò),對等網(wǎng)絡(luò)的核心思想是通過系統(tǒng)間節(jié)點(diǎn)的直接交互來實(shí)現(xiàn)信息資源和服務(wù)的共享,它具有大規(guī)模、自組織、無中心、可擴(kuò)展以及高度動態(tài)性和異構(gòu)性的特點(diǎn),已經(jīng)被廣泛應(yīng)用到了多個領(lǐng)域。資源搜索機(jī)制是P2P網(wǎng)絡(luò)中的核心研究問題,它主要解決如何在大規(guī)模的P2P網(wǎng)絡(luò)中高效地定位用戶所需的資源。由于P2P網(wǎng)絡(luò)是高度動態(tài)的,節(jié)點(diǎn)頻繁地加入和離開,資源隨機(jī)分布在P2P網(wǎng)絡(luò)中的節(jié)點(diǎn)中,增加了資源搜索的難度。因此研究P2P網(wǎng)絡(luò)的資源搜索方法是非常有必要的,以提高搜索的準(zhǔn)確度和效率。 本文首先分析了P2P網(wǎng)絡(luò)的特點(diǎn)和資源搜索方法,針對非結(jié)構(gòu)化P2P網(wǎng)絡(luò)的問題提出了一種基于轉(zhuǎn)發(fā)區(qū)間的洪泛搜索機(jī)制FIFSM (Forwarding Interval based Flooding Search Mechanism)以及改進(jìn)的FIFSM搜索機(jī)制,主要工作為： (1)首先總結(jié)了P2P網(wǎng)絡(luò)的概念、特性、應(yīng)用領(lǐng)域和研究現(xiàn)狀,然后介紹了現(xiàn)有的P2P網(wǎng)絡(luò)的資源搜索算法。 (2)針對基于洪泛的資源搜索機(jī)制引起的問題,本文提出了一種基于轉(zhuǎn)發(fā)區(qū)間的洪泛搜索機(jī)制FIFSM,通過為消息分配不相交的轉(zhuǎn)發(fā)區(qū)間,使其沿著一棵生成樹的結(jié)構(gòu)傳播,避免消息環(huán)路的產(chǎn)生,從而避免冗余消息的產(chǎn)生。FIFSM機(jī)制采用高效的網(wǎng)絡(luò)維護(hù)策略,能夠在動態(tài)環(huán)境下較低開銷地保證網(wǎng)絡(luò)的穩(wěn)定性。 (3)針對拓?fù)洳黄ヅ鋯栴},本文提出了基于LTM(Location Topology Aware)的FIFSM搜索機(jī)制,通過使用LTM方法探測節(jié)點(diǎn)之間的距離,調(diào)整覆蓋網(wǎng)的拓?fù)浣Y(jié)構(gòu),使其與底層物理網(wǎng)絡(luò)拓?fù)涓悠ヅ�。通過利用節(jié)點(diǎn)之間的鄰近性,優(yōu)化FIFSM搜索機(jī)制的洪泛算法,進(jìn)一步降低資源搜索延遲。實(shí)驗(yàn)結(jié)果表明,FIFSM機(jī)制能夠降低洪泛的開銷,避免洪泛引起的網(wǎng)絡(luò)擁塞,保證資源搜索的高成功率和低延遲,是一種有效的基于洪泛的資源搜索機(jī)制。
[Abstract]:In recent years, Peer-to-Peer (P2P) is a distributed network. The core idea of peer-to-peer network is to share information resources and services through the direct interaction of nodes between systems. It has a large scale, self-organization and no center. Extensibility, high dynamic and heterogeneity have been widely used in many fields. Resource search mechanism is the core research problem in P2P networks. It mainly solves the problem of how to efficiently locate the resources required by users in large-scale P2P networks. Since P2P networks are highly dynamic and nodes are joined and left frequently, resources are randomly distributed among nodes in P2P networks, which increases the difficulty of resource search. Therefore, it is necessary to study the resource search method of P2P network in order to improve the accuracy and efficiency of the search. Firstly, this paper analyzes the characteristics of P2P network and resource search methods, and proposes a flooding search mechanism based on forwarding interval (FIFSM forwarding Interval based Flooding Search Mechanism) and an improved FIFSM search mechanism. The main work is as follows: Firstly, the concept, characteristics, application field and research status of P2P network are summarized, and then the resource search algorithms of P2P network are introduced. In order to solve the problems caused by flooding based resource search mechanism, a flooding search mechanism FIFSM based on forwarding interval is proposed in this paper. By assigning disjoint forwarding intervals to messages, the FIFSMs propagate along the structure of a spanning tree. To avoid the generation of message loop and avoid the generation of redundant message. FIFSM mechanism adopts efficient network maintenance strategy which can guarantee the stability of the network with low overhead in dynamic environment. In order to solve the problem of topology mismatch, this paper proposes a FIFSM search mechanism based on LTM(Location Topology Aware. By using LTM method to detect the distance between nodes, the topological structure of overlay network is adjusted to match the topology of the underlying physical network. By using the proximity between nodes to optimize the flooding algorithm of FIFSM search mechanism, the delay of resource search is further reduced. The experimental results show that the FIFSM mechanism can reduce the cost of flooding, avoid the network congestion caused by flooding, and ensure the high success rate and low delay of resource search. It is an effective flooding based resource search mechanism.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TP393.02

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 楊亞;宋俊德;;一種適合異構(gòu)P2P網(wǎng)絡(luò)的樹形結(jié)構(gòu)覆蓋層[J];高技術(shù)通訊;2009年03期

2 黃道穎,劉剛,張堯,張安琳,黃建華;利用Gnutella網(wǎng)絡(luò)的拓?fù)涮匦愿倪M(jìn)其可擴(kuò)展性[J];計(jì)算機(jī)工程與應(yīng)用;2003年26期

3 李慶華,張陽,王多強(qiáng);P2P網(wǎng)絡(luò)中基于謠言傳播機(jī)制的資源搜索算法[J];計(jì)算機(jī)應(yīng)用;2005年11期

4 李運(yùn)娣;馮勇;;基于DHT的P2P搜索定位技術(shù)研究[J];計(jì)算機(jī)應(yīng)用研究;2006年10期

5 葉培順;;非結(jié)構(gòu)化P2P網(wǎng)絡(luò)的一種改進(jìn)搜索算法[J];計(jì)算機(jī)與現(xiàn)代化;2013年12期

6 蘭明敬;;特征相關(guān)的結(jié)構(gòu)化P2P結(jié)點(diǎn)編址和數(shù)據(jù)副本分發(fā)[J];計(jì)算機(jī)科學(xué);2014年10期

7 朱桂明;郭得科;金士堯;;基于副本復(fù)制和Bloom Filter的P2P概率路由算法[J];軟件學(xué)報;2011年04期

8 馬文明;孟祥武;張玉潔;;面向非結(jié)構(gòu)化P2P網(wǎng)絡(luò)的雙向隨機(jī)漫步搜索機(jī)制[J];軟件學(xué)報;2012年04期

9 王楊;王汝傳;徐小龍;;應(yīng)用移動代理的自組織P2P網(wǎng)絡(luò)模型[J];通信學(xué)報;2008年05期

10 林雅榕;侯整風(fēng);;對哈希算法SHA-1的分析和改進(jìn)[J];計(jì)算機(jī)技術(shù)與發(fā)展;2006年03期

，

本文編號：1797759