A formal framework for the performance analysis of P2P networks protocols

Angelo Spognardi, Roberto Di Pietro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations


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. © 2006 IEEE.
Original languageEnglish (US)
Title of host publication20th International Parallel and Distributed Processing Symposium, IPDPS 2006
PublisherIEEE Computer Society
ISBN (Print)1424400546
StatePublished - Jan 1 2006
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-20


Dive into the research topics of 'A formal framework for the performance analysis of P2P networks protocols'. Together they form a unique fingerprint.

Cite this