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.
A Formal Framework for the performance analysis of P2P networks protocols / Spognardi, Angelo; DI PIETRO, Roberto. - 2006:(2006). (Intervento presentato al convegno IEEE Hot-P2P ’06 tenutosi a Rhodes Island; Greece nel Aprile 2006) [10.1109/IPDPS.2006.1639714].
A Formal Framework for the performance analysis of P2P networks protocols
SPOGNARDI, Angelo;DI PIETRO, ROBERTO
2006
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
