Abstract
The measurement of a search algorithm for unstructured P2P network centres on the number of nodes not receiving their requested files (number of failures) and the number of hops per query. Most current search algorithms are unable to guarantee the success of the query. This study involves a comparison of the strengths and weaknesses of three algorithms of Gnutella P2P protocol, namely Flood, Random Walk, and Random Walk with Neighbours Table. Based on this comparison, a new query search method-referred to as Random Walk with Jumps-is proposed. The experiment proves that the proposed algorithm can obtain a better result with a small number of failures and a minimum number of hops.