Distributed randomized PageRank algorithms over unreliable channels

Distributed randomized PageRank algorithms over unreliable channels

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Developments in Control Theory Towards Glocal Control — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The PageRank algorithm, employed at Google assigns a measure of importance to each web page for ranking purposes. Recently, we have proposed a distributed randomized approach for this algorithm, where web pages compute their own PageRank by communicating over selected links. Here, the focus is on the effects of unreliability in communication, where random data losses are modeled as an outcome of Markov chains. We provide a generalization of the distributed scheme along with analysis on its convergence.

Inspec keywords: convergence; distributed algorithms; randomised algorithms

Other keywords: web page; convergence; random data losses; distributed randomized approach; distributed scheme; unreliable channels; Markov chains; pagerank algorithms

Subjects: Parallel programming and algorithm theory

Preview this chapter:
Zoom in

Distributed randomized PageRank algorithms over unreliable channels, Page 1 of 2

| /docserver/preview/fulltext/books/ce/pbce076e/PBCE076E_ch15-1.gif /docserver/preview/fulltext/books/ce/pbce076e/PBCE076E_ch15-2.gif

Related content

This is a required field
Please enter a valid email address