An adaptive randomized search protocol in peer-to-peer systems
Yu Wu, Taisuke Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa · 2007
Search problem, which is to identify the peer that has a target resource object, is an important problem in Peer-to-Peer (P2P) file sharing systems. Since P2P systems maintain large and dynamic sets of peers, the search protocol is desired to be scalable and adaptive.In this paper we propose a new P2P search protocol, called Adaptive Randomized Search Protocol (ARSP), which is an efficient extension of the Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks. ARSP minimizes the communication cost of the protocol by popularity-based index dissemination of objects. The protocol works in a self-adaptive manner: it automatically adapts to the dynamics of network environments.