Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed Systems

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Devan Sohier Articles by Alain Bui

18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 7

Santa Fe, New Mexico

April 26-April 30

ISBN: 0-7695-2132-0

	ASCII Text	x
	Devan Sohier, Alain Bui, "Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed Systems," Parallel and Distributed Processing Symposium, International, vol. 8, pp. 179a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 7, 2004.

	BibTex	x
	@article{ 10.1109/IPDPS.2004.1303187, author = {Devan Sohier and Alain Bui}, title = {Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed Systems}, journal ={Parallel and Distributed Processing Symposium, International}, volume = {8}, year = {2004}, isbn = {0-7695-2132-0}, pages = {179a}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303187}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Processing Symposium, International TI - Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed Systems SN - 0-7695-2132-0 SP EP A1 - Devan Sohier, A1 - Alain Bui, PY - 2004 KW - null VL - 8 JA - Parallel and Distributed Processing Symposium, International ER -

Devan Sohier, Université de Reims and LRIA - EPHE

Alain Bui, Université de Reims

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303187

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.