An Exhaustive Resource Discovered Method with Probabilistic Guarantees for P2P network

In recent years, P2P applications are popular and lots of applications are deployed. Because a resource discovered method is important in P2P applications, it attracts much attention from researchers. However, search algorithms face huge challenges of scalability and robustness. Based on the topology of relaxed random multigraph, a probabilistic exhaustive search algorithm for P2P network is proposed. After evaluating the desired number of data and query replicas, a new mapping atom operation called Ping-Pang mapping maps query and data replicas onto peers in the network to perform reliable exhaustive search. At last the correctness of the algorithm is proved. This search algorithm brings a number of unique advantages such as scalability, resilience and also effectiveness in coping with dynamics and heterogeneity.