文章基本信息

标题：Adaptive Probabilistic Algorithm for Peer Networks
本地全文：下载
作者：K.G.S. Venkatesan ; K.P.Kaliyamurthie
期刊名称：International Journal of Innovative Research in Science, Engineering and Technology
印刷版ISSN：2347-6710
电子版ISSN：2319-8753
出版年度：2015
卷号：4
期号：7
页码：5735
DOI：10.15680/IJIRSET.2015.0407229
出版社：S&S Publications
摘要：In unstructured peer-to-peer networks, every node doesn't have world data regarding the entire topology and also the location of different nodes. Search algorithms to find the queried resources and to route the message to the target node. Flooding and RW square measure 2 blind search algorithms b y that questio n messages square measure sent to neighbors with none information regarding the potential locations of the queried resources. Both algorithms are not suitable to route a message to target in effective manner. The proposed algorithm is d ynamic search (DS), which is a generalization of flooding and RW. Dynamic Search uses a kno wledge-based search mechanism that is Adaptive Probabilistic Search (APS). Each node co uld relay query messages more intelligently to reach the target node