Name
Abstract | ||
|---|---|---|
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’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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/CSSE.2008.1541 | CSSE (3) |
Keywords | Field | DocType |
algorithm design and analysis,bandwidth,exhaustive search,artificial neural networks,p2p,search algorithm,topology | Birthday problem,Search algorithm,Computer science,Theoretical computer science,Artificial intelligence,Probabilistic logic,Distributed computing,Replica,Algorithm design,Brute-force search,Machine learning,Database,Best-first search,Scalability | Conference |
Volume | Issue | Citations |
3 | null | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |