By Topic

Hitting times computation for theoretically studying peer-to-peer distributed systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Sohier ; LICA, Univ. de Reims Champagne Ardenne, France ; A. Bui

Summary form only given. Random walks based algorithms give efficient solutions to many distributed problems. The hitting time, i.e. the average time for the walk starting at a given vertex to first hit another given vertex is one of the main quantity used in the analysis of such algorithms. The growing use of peer-to-peer systems leads to a high bandwidth consumption and random walks are currently investigated as a solution to improve peer-to-peer systems efficiency. Such systems are often modeled by weighted graphs. We show how hitting times can be used in peer-to-peer distributed systems to compare the efficiency of deterministic and random-walks based procedures. An expression of the hitting times on a weighted graph in terms of effective resistances is established. Then, an efficient method to compute all the hitting times on a graph is presented. This method is illustrated by a detailed example.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004