Evaluating the Dynamic Behaviour of PROSA P2P Network

  • Vincenza Carchiolo
  • Michele Malgeri
  • Giuseppe Mangioni
  • Vincenzo Nicosia
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4330)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bawa, M., Manku, G.S., Raghavan, P.: Sets: search enhanced by topic segmentation. In: SIGIR 2003: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, New York, USA, pp. 306–313. ACM Press, New York (2003)CrossRefGoogle Scholar
  2. 2.
    Carchiolo, V., Malgeri, M., Mangioni, G., Nicosia, V.: Prosa: P2p resource organisation by social acquaintances. In: AP2PC – Agents and P2P Computing Workshop at AAMAS 2 006 (2006)Google Scholar
  3. 3.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Loo, B.T., Huebsch, R., Stoica, I., Hellerstein, J.M.: The case for a hybrid p2p search infrastructure. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 141–150. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA (2000)Google Scholar
  6. 6.
    Milgram, S.: The small world problem. Psychol. Today 2, 60–67 (1967)Google Scholar
  7. 7.
    Salton, G., Buckley, C.: Term weighting approaches in automatic text retrieval. Technical report, Ithaca, NY, USA (1987)Google Scholar
  8. 8.
    Schutze, H., Silverstein, C.: A comparison of projections for efficient document clustering. In: Proceedings of ACM SIGIR, Philadelphia, PA, July 1997, pp. 74–81 (1997)Google Scholar
  9. 9.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  10. 10.
    Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (April 2001)Google Scholar
  11. 11.
    Zhu, Y., Yang, X., Hu, Y.: Making search efficient on gnutella-like p2p systems. In: Parallel and Distributed Processing Symposium, 2005. Proceedings 19th IEEE International, pp. 56a–56a. IEEE Computer Society, Los Alamitos (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vincenza Carchiolo
    • 1
  • Michele Malgeri
    • 1
  • Giuseppe Mangioni
    • 1
  • Vincenzo Nicosia
    • 1
  1. 1.Dipartimento di Ingegneria Informatica e delle Telecomunicazioni, Facoltà di IngegneriaUniversità di CataniaCatania(Italy)

Personalised recommendations