文章基本信息

标题：Uncertainty of Rendezvous and Unsurpassed Random Walk
本地全文：下载
作者：Monisha.S. ; Mrs.K.Ulagapriya
期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2015
卷号：6
期号：2
页码：1127-1129
出版社：TechScience Publications
摘要：The P2P is the peer to peer sharing of resources or information through the process of searching among them. This holds a widest process, if it is not carried out by proper methods, it leads to a problematic result which will not retrieve the appropriate information in the appropriate time. Even though this is a typical way of searching, this can be easily solved using the rendezvous problem and random walk. Rendezvous can capture the particular resolution or the information required only if the particular peer having that particular data is constantly not moved to any other peer until it is found during the search. If this fails, it fails to find the needed data. Especially For this purpose we move on to the random walk. This finds that information through its particular successive patterns, even when the information hides in some other nodes or peers. Furthermore, random walk is more advantageous than the rendezvous and solves in a better way, the in abilities of the problems that occurs during the resource discovery.
关键词：Rendezvous problem; Resource discovery; Random;walk; Resolution