Resource searching in an unstructured P2P network based on Cloning Random Walker assisted by Dominating Set

  • Authors:

  • Jenq-Shiou Leu;Cheng-Wei Tsai;Wei-Hsiang Lin

  • Affiliations:

  • Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan;Department of Digital R&D, MStar Semiconductor Inc., Taipei, Taiwan;Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. Most of them may only be beneficial for searching a popular object. In this paper, we propose a Cloning Random Walker assisted by Dominating Set (CloneRW+DS) method to adaptively locate the target object no matter the target object is popular or unpopular in a P2P network. Our theoretical analysis shows that our proposed method consumes a moderate amount of query messages between the message amount in the Random Walker method and the one in the flooding method. Additionally, our simulation results also depict that our proposed scheme can perform a better trade-off among the search delay, message overhead per hit and success rate while conducting resource searching in a P2P network.