【摘要】：隨著網(wǎng)絡(luò)的多樣化發(fā)展,對(duì)等網(wǎng)絡(luò)(P2P,Peer to Peer)作為一種新型的網(wǎng)絡(luò)應(yīng)運(yùn)而生并迅速發(fā)展。分布式P2P網(wǎng)絡(luò)中的節(jié)點(diǎn)(Peer)之間地位是相等的并且他們之間可以直接交互,整個(gè)網(wǎng)絡(luò)的性能理論上是所有節(jié)點(diǎn)性能的總和,相對(duì)于傳統(tǒng)的集中式拓?fù)渚W(wǎng)絡(luò)可擴(kuò)展性也更好。伴隨P2P網(wǎng)絡(luò)的規(guī)模及用戶的增多,P2P技術(shù)的應(yīng)用領(lǐng)域也越來(lái)越廣泛,進(jìn)而整個(gè)環(huán)境中的信息量也呈現(xiàn)飛速增長(zhǎng),用戶在P2P網(wǎng)絡(luò)進(jìn)行搜索、定位及獲取資源時(shí)也越來(lái)越困難。研究P2P網(wǎng)絡(luò)的信息搜索技術(shù)成為解決這一問題的重要手段。個(gè)好的搜索技術(shù)不但能有效的提高路由效率,增加搜索命中率,還能根據(jù)資源的興趣分布縮短搜索的范圍,節(jié)約用戶的搜索時(shí)間,提高工作效率。由此可見,研究如何優(yōu)化P2P網(wǎng)絡(luò)的搜索技術(shù)這一課題具有很大的價(jià)值。 現(xiàn)如今圍繞P2P搜索技術(shù)課題的研究大多是關(guān)系結(jié)構(gòu)化P2P網(wǎng)絡(luò)的,因此,本文在以往研究的基礎(chǔ)上,提出一種基于興趣分組的混合P2P網(wǎng)絡(luò)IGTAP(Int erest-Group Tapestry model).它以Small World為理論依據(jù),將分組的理念引入到網(wǎng)絡(luò)中,以節(jié)點(diǎn)的興趣作為分組的依據(jù),將整個(gè)P2P網(wǎng)絡(luò)分為不同的興趣組。同時(shí)引入分層的概念,以Tapestry作為底層拓?fù)浣Y(jié)構(gòu),將Tapestry層分為不同的興趣組,節(jié)點(diǎn)根據(jù)自己的興趣加入到不同的興趣組中。興趣組內(nèi)的節(jié)點(diǎn)之間的興趣距離是根據(jù)興趣相似度計(jì)算得來(lái)的。第二層的樹形結(jié)構(gòu)是由鄰居映射表伸展成的一個(gè)多叉樹,每個(gè)興趣組下都有一個(gè)多義樹,并且每個(gè)節(jié)點(diǎn)只能加入到一個(gè)興趣組。網(wǎng)絡(luò)中的搜索策略分為組內(nèi)搜索和組間搜索。組內(nèi)搜索是指節(jié)點(diǎn)對(duì)本興趣組內(nèi)資源的搜索；組間搜索是在組內(nèi)搜索失敗或者所要搜索的資源不在本組內(nèi)時(shí)發(fā)生的情況。搜索的過程中還引入緩沖池策略,很好的解決了短時(shí)間內(nèi)搜索相同資源而引起的網(wǎng)絡(luò)資源的浪費(fèi)。 最后通過對(duì)網(wǎng)絡(luò)的分析和模擬實(shí)驗(yàn),結(jié)果表明本文方案有效的提高了查詢成功率,縮短了路由跳數(shù),同時(shí)提高了搜索的精準(zhǔn)率。
[Abstract]:With the development of network diversification, peer-to-peer network (P2P) emerges and develops rapidly as a new type of network. Peers in distributed P2P network have equal status and can interact with each other directly. The performance of the whole network is theoretically the sum of all the nodes'performance, which is relative to the traditional centralization. With the increase of the scale of P2P network and the number of users, the application fields of P2P technology are more and more extensive, and the amount of information in the whole environment is also increasing rapidly. It is more and more difficult for users to search, locate and obtain resources in P2P network. A good search technology can not only effectively improve routing efficiency, increase the hit rate of search, but also shorten the search scope according to the interest distribution of resources, save the search time of users and improve work efficiency. Value.
Nowadays, the research on P2P search technology is mostly about relational structured P2P networks. Therefore, based on previous research, this paper proposes a hybrid P2P network IGTAP (Int erest-Group Tapestry model) based on interest grouping. It introduces the concept of grouping into the network based on the theory of Small World and takes the interest of nodes as its basis. As the basis of grouping, the whole P2P network is divided into different interest groups. At the same time, the concept of hierarchy is introduced. Tapestry is used as the underlying topology structure, and Tapestry layer is divided into different interest groups. The nodes join different interest groups according to their own interest. The interest distance between the nodes in interest groups is calculated according to the interest similarity. The tree structure of the second layer is a multi-tree extending from the neighborhood mapping table. Each interest group has a multi-tree and each node can only join one interest group. Cable occurs when the group search fails or the resources to be searched are not in the group. Buffer pool strategy is introduced to solve the waste of network resources caused by searching the same resources in a short time.
Finally, through the network analysis and simulation experiments, the results show that the proposed scheme effectively improves the query success rate, shortens the number of routing hops, and improves the search accuracy.
【學(xué)位授予單位】：大連交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.02

【相似文獻(xiàn)】

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

1 多多;;中搜IG:新一代搜索技術(shù)[J];互聯(lián)網(wǎng)天地;2007年03期

2 康夫;;完美的搜索技術(shù)[J];互聯(lián)網(wǎng)天地;2009年07期

3 宋斌 ,方小璐;基于內(nèi)容的多媒體搜索技術(shù)探討[J];微型機(jī)與應(yīng)用;2002年01期

4 ;挖掘聲音圖像信息——第三代搜索技術(shù)展望[J];每周電腦報(bào);2005年21期

5 蓋明媚;;FAST搜索技術(shù)及其應(yīng)用研究[J];科技信息(科學(xué)教研);2008年21期

6 盛嘉;;找到你的臉——智能圖片搜索技術(shù)[J];互聯(lián)網(wǎng)天地;2009年02期

7 Amit Singhal;吳倩;;搜索的未來(lái)[J];IT經(jīng)理世界;2010年18期

8 霍林;黃俊文;潘英花;王力;;大規(guī)模分布式資源搜索技術(shù)研究進(jìn)展[J];計(jì)算機(jī)應(yīng)用研究;2010年11期

9 ;拉搜索技術(shù)一把[J];每周電腦報(bào);1997年13期

10 李剛;;搜索技術(shù)圖書攻略[J];程序員;2006年06期

相關(guān)會(huì)議論文 前7條

1 謝力;;云時(shí)代的圖片存儲(chǔ)與搜索技術(shù)研究[A];四川省通信學(xué)會(huì)Ip應(yīng)用與增值電信技術(shù)會(huì)議論文集[C];2011年

2 楊崇俊;劉冬林;張富慶;王剛;付理;楊洪志;田生軍;李彬;張薈娟;王芙蓉;李津平;樂小虬;張建兵;宋子輝;;電子政務(wù)與隱形搜索技術(shù)-詞虎[A];中國(guó)測(cè)繪學(xué)會(huì)2006年學(xué)術(shù)年會(huì)論文集[C];2006年

3 楊崇俊;劉冬林;張富慶;王剛;付理;楊洪志;田生軍;李彬;張薈娟;王芙蓉;李津平;樂小虬;張建兵;宋子輝;;電子政務(wù)與隱形搜索技術(shù)——詞虎[A];提高全民科學(xué)素質(zhì)、建設(shè)創(chuàng)新型國(guó)家——2006中國(guó)科協(xié)年會(huì)論文集（下冊(cè)）[C];2006年

4 陸宇e，

本文編號(hào)：2178652