基于興趣分組的混合P2P網(wǎng)絡研究
發(fā)布時間：2018-08-12 09:33
【摘要】：隨著網(wǎng)絡的多樣化發(fā)展,對等網(wǎng)絡(P2P,Peer to Peer)作為一種新型的網(wǎng)絡應運而生并迅速發(fā)展。分布式P2P網(wǎng)絡中的節(jié)點(Peer)之間地位是相等的并且他們之間可以直接交互,整個網(wǎng)絡的性能理論上是所有節(jié)點性能的總和,相對于傳統(tǒng)的集中式拓撲網(wǎng)絡可擴展性也更好。伴隨P2P網(wǎng)絡的規(guī)模及用戶的增多,P2P技術的應用領域也越來越廣泛,進而整個環(huán)境中的信息量也呈現(xiàn)飛速增長,用戶在P2P網(wǎng)絡進行搜索、定位及獲取資源時也越來越困難。研究P2P網(wǎng)絡的信息搜索技術成為解決這一問題的重要手段。個好的搜索技術不但能有效的提高路由效率,增加搜索命中率,還能根據(jù)資源的興趣分布縮短搜索的范圍,節(jié)約用戶的搜索時間,提高工作效率。由此可見,研究如何優(yōu)化P2P網(wǎng)絡的搜索技術這一課題具有很大的價值。 現(xiàn)如今圍繞P2P搜索技術課題的研究大多是關系結構化P2P網(wǎng)絡的,因此,本文在以往研究的基礎上,提出一種基于興趣分組的混合P2P網(wǎng)絡IGTAP(Int erest-Group Tapestry model).它以Small World為理論依據(jù),將分組的理念引入到網(wǎng)絡中,以節(jié)點的興趣作為分組的依據(jù),將整個P2P網(wǎng)絡分為不同的興趣組。同時引入分層的概念,以Tapestry作為底層拓撲結構,將Tapestry層分為不同的興趣組,節(jié)點根據(jù)自己的興趣加入到不同的興趣組中。興趣組內(nèi)的節(jié)點之間的興趣距離是根據(jù)興趣相似度計算得來的。第二層的樹形結構是由鄰居映射表伸展成的一個多叉樹,每個興趣組下都有一個多義樹,并且每個節(jié)點只能加入到一個興趣組。網(wǎng)絡中的搜索策略分為組內(nèi)搜索和組間搜索。組內(nèi)搜索是指節(jié)點對本興趣組內(nèi)資源的搜索；組間搜索是在組內(nèi)搜索失敗或者所要搜索的資源不在本組內(nèi)時發(fā)生的情況。搜索的過程中還引入緩沖池策略,很好的解決了短時間內(nèi)搜索相同資源而引起的網(wǎng)絡資源的浪費。 最后通過對網(wǎng)絡的分析和模擬實驗,結果表明本文方案有效的提高了查詢成功率,縮短了路由跳數(shù),同時提高了搜索的精準率。
[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.
【學位授予單位】：大連交通大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.02
[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.
【學位授予單位】：大連交通大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.02
【相似文獻】
相關期刊論文 前10條
1 多多;;中搜IG:新一代搜索技術[J];互聯(lián)網(wǎng)天地;2007年03期
2 康夫;;完美的搜索技術[J];互聯(lián)網(wǎng)天地;2009年07期
3 宋斌 ,方小璐;基于內(nèi)容的多媒體搜索技術探討[J];微型機與應用;2002年01期
4 ;挖掘聲音圖像信息——第三代搜索技術展望[J];每周電腦報;2005年21期
5 蓋明媚;;FAST搜索技術及其應用研究[J];科技信息(科學教研);2008年21期
6 盛嘉;;找到你的臉——智能圖片搜索技術[J];互聯(lián)網(wǎng)天地;2009年02期
7 Amit Singhal;吳倩;;搜索的未來[J];IT經(jīng)理世界;2010年18期
8 霍林;黃俊文;潘英花;王力;;大規(guī)模分布式資源搜索技術研究進展[J];計算機應用研究;2010年11期
9 ;拉搜索技術一把[J];每周電腦報;1997年13期
10 李剛;;搜索技術圖書攻略[J];程序員;2006年06期
相關會議論文 前7條
1 謝力;;云時代的圖片存儲與搜索技術研究[A];四川省通信學會Ip應用與增值電信技術會議論文集[C];2011年
2 楊崇俊;劉冬林;張富慶;王剛;付理;楊洪志;田生軍;李彬;張薈娟;王芙蓉;李津平;樂小虬;張建兵;宋子輝;;電子政務與隱形搜索技術-詞虎[A];中國測繪學會2006年學術年會論文集[C];2006年
3 楊崇俊;劉冬林;張富慶;王剛;付理;楊洪志;田生軍;李彬;張薈娟;王芙蓉;李津平;樂小虬;張建兵;宋子輝;;電子政務與隱形搜索技術——詞虎[A];提高全民科學素質(zhì)、建設創(chuàng)新型國家——2006中國科協(xié)年會論文集（下冊）[C];2006年
4 陸宇e，
本文編號：2178652
本文鏈接：http://sikaile.net/guanlilunwen/ydhl/2178652.html
最近更新
教材專著
