An Exhaustive Resource Search Algorithm Based on Ping-Pang Mapping

摘要

A resource search algorithm gravely affects the performance of P2P system. This paper proposes a probabilistic and exhaustive search algorithm, which has the merits of structured and unstructured P2P system. The topology of system employs a relaxed random multigraph which is scalable. The algorithm firstly evaluates the desired number of replica of data and query by the birthday paradox theory, which is determined by the userȁ9;s reliable requirement, and then maps the replica of data and query onto peers in the network by Ping-Pang mapping to perform the exhaustive search. This algorithm overcomes the drawback that the search range is limited and some existing resources can not be found in the unstructured P2P.