Evaluating the dynamic behaviour of PROSA P2P network

In this paper we present and simulate a new self–organising algorithm for P2P unstructured networks inspired by human relationships. This algorithm, called PROSA, tries to simulate the evolution of human relationships from simple acquaintance to friendship and partnership. Our target is to obtain a self–reconfiguring P2P system which possesses some of the desirable features of social communities. The most useful property of many natural social communities is that of beeing “small–worlds”, since in a small–world network queries usually require a small amount of “hops” to walk from a source to a destination peer. We show that PROSA naturally evolves into a small–world network, with an high clustering coefficient and a relly short average path length.