Distributed Page Ranking in Structured P2P Networks

This paper discusses the techniques of performing distributed page ranking on top of structured peer-to-peer networks. Distributed page ranking are needed because the size of the web grows at a remarkable speed and centralized page ranking is not scalable. Open System PageRank is presented in this paper based on the traditional PageRank used by Google. We then propose some distributed page ranking algorithms, partially prove their convergence, and discuss some interesting properties of them. Indirect transmission is introduced in this paper to reduce communication overhead between page rankers and to achieve scalable communication. The relationship between convergence time and bandwidth consumed is also discussed. Finally, we verify some of the discussions by experiments based on real datasets.

• Type: Conference
• Year: 2003
• Where: ICPP
• Authors: Shuming Shi, Jin Yu, Guangwen Yang, Dingxing Wang
• Keywords: Centralized Page Ranking, Distributed And Parallel Computing, ICPP 2003, Page Ranking, Page Ranking Algorithms