@INPROCEEDINGS{Shi_03d,
     AUTHOR      = {S. Shi and J. Yu and G. Yang and D. Wang},
     TITLE       = {Distributed Page Ranking in Structured P2P Networks},
     BOOKTITLE   = {Proceedings of 2003 International Conference on Parallel Processing (ICPP'03)},
     YEAR        = {2003},
     EDITOR      = {},
     PAGES       = {179},
     PUBLISHER   = {},
     VOLUME      = {},
     NUMBER      = {},
     SERIES      = {},
     ADDRESS     = {},
     MONTH       = {},
     NOTE        = {},
     KEY         = {},
     KEYWORDS    = {},
     ISBN        = {},
     URL         = {http://doi.ieeecomputersociety.org/10.1109/ICPP.2003.1240579},
     ABSTRACT    = {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. },
}