Authors: Sunantha Sodsee, Maytiyanin Komkhao, Herwig Unger and Phayung Meesad
In this paper, we develop a distributed random walk-based pagerank algorithm for P2P systems. This proposed algorithm is used to rank importance of nodes in networks by using a visiting probability of a population of random walk sand network parameters to quantify the ranking definition. A method to estimate the rank of node and a convergence factor when focused on an initial static rank is also presented. To illustrate an effectiveness of our work, the work is compared to the PageRank algorithm on both grid and torus grid overlay P2P networks. The simulation results show that the performance of the proposed work is significantly efficient in the node ranking with the bandwidth consideration.
Keywords: ranking algorithm; pagerank; random walk;bandwidth; P2P systems