Resource Searching in an Unstructured P2P Network Based on Cloning Random Walker Assisted by Dominating Set

Peer-To-Peer (P2P) networks have been developed for resource sharing for years. In a P2P network, the first and foremost challenge is resource searching to find out target objects (i.e., data, file, etc.) scattered in the P2P network. The searching efficiency highly depends on the popularity of the target object. However, the popularity is too variable to be estimated since a P2P network is dynamic. A good searching scheme in such a variable environment with a better trade-off among long searching time, a large amount of duplicated query messages and a low successful search hit rate is hard to be determined. Many efficient methods have been proposed to resolve this issue.

Provided by: Reed Elsevier Topic: Collaboration Date Added: Oct 2010 Format: PDF

Find By Topic