A review of new advances in resource discovery approaches in unstructured P2P networks

Since the emergence of peer to peer networks, search efficiency in such networks has been a matter of great concern, as it directly effects resource management of the network and influences users´ satisfaction. In unstructured p2p networks, various search algorithms have been proposed so far that offer a tradeoff between scalability, congestion and user´s satisfaction. In this paper, we survey newly introduced approaches to overcome search process problems. By reviewing these strategies and comparing them with previous search methods, we propose a new classification of informed search algorithms and we conclude that regarding this classification, informed search algorithms should be applied in less dynamic networks while blind search algorithms are more appropriate in highly dynamic networks. We believe that this taxonomy and the new classification can be useful as a guide for future search algorithm design.