Proceedings 20th IEEE International Parallel & Distributed Processing Symposium A formal framework for the performance analysis of P2P networks protocols Rhodes Island, Greece April 25-April 29 ISBN: 1-4244-0054-6
In this paper, we propose a formal framework based on the Markov chains to prove the performance of P2P protocols. Despite the proposal of several protocols for P2P networks, sometimes there is a lack of a formal demonstration of their performance: experimental simulations are the most used method to evaluate their performance, such as the average length of a lookup. In this paper, we introduce a versatile model for the analysis of P2P protocols. We employ this model to formally prove which is the average lookup length for two sample protocols: BaRT and Koorde. We verify the effectiveness of the proposed framework also via extensive simulations.
Index Terms:
Koorde protocol, performance analysis, P2P networks protocol, Markov chains, performance evaluation, BaRT protocol
Citation:
A. Spognardi, R. Di Pietro, "A formal framework for the performance analysis of P2P networks protocols," ipdps, pp.457, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb