Distributed PageRank computation with link failures

Authors:
Hideaki Ishii;Roberto Tempo
Affiliations:
Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, Yokohama, Japan;IEIIT-CNR, Politecnico di Torino, Torino, Italy
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 13
Cited 0

Matrix analysis

Matrix analysis
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Distributed PageRank computation based on iterative aggregation-disaggregation methods

Proceedings of the 14th ACM international conference on Information and knowledge management
Google's PageRank and Beyond: The Science of Search Engine Rankings

Google's PageRank and Beyond: The Science of Search Engine Rankings
The $25,000,000,000 Eigenvector: The Linear Algebra behind Google

SIAM Review
Asynchronous iterative solution for state-based performance metrics

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient

SIAM Journal on Numerical Analysis
Optimal control of LTI systems over unreliable communication links

Automatica (Journal of IFAC)
Communication constraints in the average consensus problem

Automatica (Journal of IFAC)
Brief paper: A subband coding approach to control under limited data rates and message losses

Automatica (Journal of IFAC)
Average Consensus with Packet Drop Communication

SIAM Journal on Control and Optimization
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications

Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Google search engine employs the so-called PageRank algorithm for ranking the search results. This algorithm quantifies the importance of each web page based on the link structure of the web. In this paper, we continue our recent work on distributed randomized computation of PageRank, where the pages locally determine their values by communicating with linked pages. In particular, we propose a distributed randomized algorithm with limited information, where only part of the linked pages is required to be contacted. This is useful to enhance flexibility and robustness in computation and communication.