文章基本信息

标题：Dynamic Search In Un-Structured Peer-To-Peer Networks
本地全文：下载
作者：Dr. B Sankara Babu
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2017
卷号：6
期号：1
页码：1250
DOI：10.15680/IJIRSET.2017.0601136
出版社：S&S Publications
摘要：Peer-to-peer networks are becoming popular today because thesenetworks offer sharing of resourcesthrough direct exchange. In unstructured peer-to-peer networks, each node does not have global information about thewhole topology and the location of other nodes. A dynamic property of unstructured P2P networks, capturing globalbehaviour is also difficult. Search algorithms to locate the queried resources and to route the message to the target node.Flooding and Random walk are two typical examples of blind search algorithms by which query messages are sent toneighbours without any knowledge about the possible locations of the queried resources or any preference for thedirections to send. Both algorithms are not suitable to route a message to target. Dynamic search improves theperformance of searching by using the super peers which operates both as a server to a set of clients and an equal in thenetwork of super peers. Dynamic search reduces the number of messages by using the knowledge based searching.Each node could relay query messages more efficiently to reach the target node.
关键词：Peer-To-Peer Networks; Flooding; Super Peer