Skip to main content

On Constructing Small Worlds in Unstructured Peer-to-Peer Systems

  • Conference paper
Current Trends in Database Technology - EDBT 2004 Workshops (EDBT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3268))

Included in the following conference series:

Abstract

Peer-to-peer systems have evolved as a means to share large amounts of data among autonomous nodes. A central issue in this context is locating nodes with data matching a user query. In this paper, we consider building peer-to-peer systems with small-world properties, that is, connecting the nodes to each other so that: (i) the distance between any two nodes is small and (ii) relevant nodes are connected to each other. Relevance between nodes is defined based on the probability that the two nodes match similar queries. We propose decentralized procedures for constructing small worlds based on routing indexes that describe the content of neighboring nodes. Our experimental results show that small-world peer-to-peer systems built with these procedures increase recall, that is, the percentage of relevant results returned.

Work supported in part by the IST programme of the European Commission FET under the IST-2001-32645 DBGlobe project

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Banaei-Kashani, F., Shahaby, C.: Searchable Querical Data Networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 17–32. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Bawa, M., Manku, G.S., Raghavan, P.: SETS: Search Enhanced by Topic Segmentation. In: SIGIR (2003)

    Google Scholar 

  3. Bloom, B.: Space/Time Trade-offs in Hash Coding with Allowable Errors. CACM 13(7) (1970)

    Google Scholar 

  4. Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-Peer Systems. In: ICDCS (2002)

    Google Scholar 

  5. Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems. Technical report (submitted for publication, 2002)

    Google Scholar 

  6. Morris, R., Stoica, I., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. IEEE/ACM Trans. on Networking 11(1), 17–32 (2003)

    Article  Google Scholar 

  7. Iamnitchi, A., Ripeanu, M., Foster, I.T.: Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 232. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Koloniari, G., Petrakis, Y., Pitoura, E.: Content-Based Overlay Networks for XML Peers Based on Multi-Level Bloom Filters. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 232–247. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Loser, A., Naumann, F., Siberski, W., Nejdl, W., Thaden, U.: Semantic Overlay Clusters within Super-Peer Networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 33–47. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Manku, S., Bawa, M., Raghavan, P.: Symphony: Distributed Hashing in a Small World. In: USENIX Symposium on Internet Technologies and Systems (2003)

    Google Scholar 

  11. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-Addressable Network. In: SIGCOMM (2001)

    Google Scholar 

  12. Rhea, S.C., Kubiatowicz, J.: Probabilistic Location and Routing. In: INFOCOM (2002)

    Google Scholar 

  13. Schmidt, C., Parashar, M.: Flexible Information Discovery in Decentralized Distributed Systems. In: HPDC (2003)

    Google Scholar 

  14. Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks. In: SIGCOMM (2003)

    Google Scholar 

  15. Triantafillou, P., Xiruhaki, C., Koubarakis, M., Ntarmos, N.: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In: CIDR (2003)

    Google Scholar 

  16. Watts, D.J., Strogatz, S.H.: Collective Dynamics of Small-World Networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petrakis, Y., Pitoura, E. (2004). On Constructing Small Worlds in Unstructured Peer-to-Peer Systems. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds) Current Trends in Database Technology - EDBT 2004 Workshops. EDBT 2004. Lecture Notes in Computer Science, vol 3268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30192-9_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30192-9_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30192-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics