Abstract
Resource discovery in unstructured peer-to-peer (P2P) networks is a challenging problem. With the absence of structure, developing a good and simple search algorithm is a key issue. Many algorithms have already emerged to address this issue, but there are always trade-offs between various performance measures. In this paper, two hybrid algorithms for unstructured P2P networks are proposed. The first is a combination of Flooding and Random Walk approaches, while the second combines Flooding with Random Walk with Neighbours Table. The performance of each algorithm was investigated in a simulated unstructured P2P network under variable conditions. Simulation results showed that hybrid algorithms provide the most balanced performance regarding the average number of hops, average search time and number of failures when compared to the basic resource discovery algorithms. 1877-0509 (C) 2017 The Authors. Published by Elsevier B.V.