期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2013
卷号：4
期号：5
页码：671-674
出版社：TechScience Publications
摘要：Peer-to-Peer (P2P) is one of the new computer networking paradigms, and currently finds applications in many diverse fields such as large-scale distributed computations and live media streaming. This paradigm is built around the concept of leveraging the resources of the participants to perform its functions in a manner which is robust and scales reasonably. One of the major difficulties, however, with P2P environments is the need for an efficient searching algorithm. Currently, there are algorithms such as Flooding and Random Walk (RW) algorithms, each having pros and cons of their own. While the Flooding algorithm searches by means of 'flooding' or broadcasting a search everywhere and covers most nodes in the system, it generates a large amount of search messages which increase the cost of the algorithm. On the other hand, the RW algorithm searches much more conservatively and incurs only a fixed cost for each hop, but takes much longer to finish the search. This paper proposes the Dynamic Search Algorithm (DS), a generalization of flooding and RW. It resembles flooding for short search and RW for longrun search.
