A formal framework for the performance analysis of P2P networks protocols

Angelo Spognardi; Roberto Di Pietro

doi:10.1109/IPDPS.2006.1639714

A formal framework for the performance analysis of P2P networks protocols

Angelo Spognardi, Roberto Di Pietro

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 Scopus citations

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.

Original language	English (US)
Title of host publication	20th International Parallel and Distributed Processing Symposium, IPDPS 2006
Publisher	IEEE Computer Society
ISBN (Print)	1424400546
DOIs	https://doi.org/10.1109/IPDPS.2006.1639714
State	Published - Jan 1 2006
Externally published	Yes

Access to Document

10.1109/IPDPS.2006.1639714

Cite this

@inproceedings{18df42a099e246c995b49e6ddfb6bea6,

title = "A formal framework for the performance analysis of P2P networks protocols",

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. {\textcopyright} 2006 IEEE.",

author = "Angelo Spognardi and {Di Pietro}, Roberto",

note = "Generated from Scopus record by KAUST IRTS on 2023-09-20",

year = "2006",

month = jan,

day = "1",

doi = "10.1109/IPDPS.2006.1639714",

language = "English (US)",

isbn = "1424400546",

booktitle = "20th International Parallel and Distributed Processing Symposium, IPDPS 2006",

publisher = "IEEE Computer Society",

address = "United States",

}

TY - GEN

T1 - A formal framework for the performance analysis of P2P networks protocols

AU - Spognardi, Angelo

AU - Di Pietro, Roberto

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

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://ieeexplore.ieee.org/document/1639714/

UR - http://www.scopus.com/inward/record.url?scp=33847102799&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2006.1639714

DO - 10.1109/IPDPS.2006.1639714

M3 - Conference contribution

SN - 1424400546

BT - 20th International Parallel and Distributed Processing Symposium, IPDPS 2006

PB - IEEE Computer Society

ER -

A formal framework for the performance analysis of P2P networks protocols

Abstract

Access to Document

Other files and links

Fingerprint

Cite this