loading...
Distributed Page Ranking in Structured P2P Networks
Kaohsiung, Taiwan October 06-October 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2003.12405792003 International Conference on Para ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ShuMing Shi, Tsinghua University, Beijing
Jin Yu, Tsinghua University, Beijing
GuangWen Yang, Tsinghua University, Beijing
DingXing Wang, Tsinghua University, Beijing
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.
Citation:
ShuMing Shi, Jin Yu, GuangWen Yang, DingXing Wang, "Distributed Page Ranking in Structured P2P Networks," icpp, pp.179, 2003 International Conference on Parallel Processing (ICPP'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions