Abstract

The resource distribution and peer links in P2P network have an obvious scale free character follows power law distribution . Using this inherent character of P2P network to design resource search strategy is great significant for improving the search efficiency and reducing the costs. We analyze the scale free character in P2P network, and propose the reliable random walk search algorithm which can achieve high and reliable resource search through transferring query messages based on P2P power law distribution. We design simulation experiments to evaluate the performance of our reliable random walk. The simulation experimental results show that the reliable random walk based on power law distribution is a scalable resource search algorithm with high and reliable search efficiency and low search costs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call