18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 7 Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed Systems Santa Fe, New Mexico April 26-April 30 ISBN: 0-7695-2132-0
This paper presents a generalization of the results about the link between resistances and random walks on a graph. An efficient method to compute hitting times on a graph is also described. These results are to be used in comparisons between distributed randomized and deterministic procedures, including, but not limited to, peer-to-peer networks and GRID computing.
Citation:
Devan Sohier, Alain Bui, "Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed Systems," ipdps, vol. 8, pp.179a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 7, 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||