A formal framework for the performance analysis of P2P networks protocols

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.

[1]  Flavio D'Alessandro.  A combinatorial problem on Trapezoidal words , 2002, Theor. Comput. Sci..

[2]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[3]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[4]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[5]  Karl Aberer,et al.  P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.

[6]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[7]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[8]  Luigi V. Mancini,et al.  BaRT, balanced randomized tree: a scalable and distributed protocol for lookup in peer-to-peer networks , 2004 .

[9]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

[10]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[11]  Jean-Loup Guillaume,et al.  Statistical Analysis of a P2P Query Graph Based on Degrees and Their Time-Evolution , 2004, IWDC.

[12]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[13]  J. Frankel,et al.  The gnutella protocol specification v0.4 document revision 1.2 , 2000 .

[14]  Gennaro Cordasco,et al.  Brief announcement: degree: optimal deterministic routing for P2P systems , 2004, PODC '04.

[15]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[16]  Gennaro Cordasco,et al.  Degree-optimal deterministic routing for P2P systems , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[17]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[18]  N. Zanghí,et al.  Probability models , 1984 .

[19]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.