Skip to main content

PROSA: P2P Resource Organisation by Social Acquaintances

  • Conference paper
Book cover Agents and Peer-to-Peer Computing (AP2PC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4461))

Included in the following conference series:

Abstract

P2P overlay networks have been deeply studied in the last few years. The main problems of such networks are resources distribution and retrieving. In this paper is presented. It is based on a novel adaptive algorithm to build an efficient and semantically searchable P2P system. This algorithm is inspired by human relationships, since social communities possess some interesting properties (such as being “small–worlds”) that allow fast and efficient routing of queries for resources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

  3. 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 (2001)

    Google Scholar 

  4. Loo, B., Huebsch, R., Stoica, I., Hellerstein, J.: The case for a hybrid p2p search infrastructure. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, Springer, Heidelberg (2005)

    Google Scholar 

  5. 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, pp. 306–313. ACM Press, New York (2003)

    Chapter  Google Scholar 

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

  7. Milgram, S.: The small world problem. Psychol Today 2, 60–67 (1967)

    Google Scholar 

  8. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  9. Salton, G., Buckley, C.: Term weighting approaches in automatic text retrieval. Technical report, Ithaca, NY, USA (1987)

    Google Scholar 

  10. Schutze, H., Silverstein, C.: A comparison of projections for efficient document clustering. In: Prooceedings of ACM SIGIR, Philadelphia, PA, pp. 74–81 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sam Joseph Zoran Despotovic Gianluca Moro Sonia Bergamaschi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carchiolo, V., Malgeri, M., Mangioni, G., Nicosia, V. (2008). PROSA: P2P Resource Organisation by Social Acquaintances. In: Joseph, S., Despotovic, Z., Moro, G., Bergamaschi, S. (eds) Agents and Peer-to-Peer Computing. AP2PC 2006. Lecture Notes in Computer Science(), vol 4461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79705-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79705-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79704-3

  • Online ISBN: 978-3-540-79705-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics