Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System

  • Pierre Fraigniaud
  • Philippe Gauron
  • Matthieu Latapy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3648)

Abstract

It was recently observed that the user interests in P2P systems possess clustering properties that can be used to reduce the amount of traffic of flooding-based search strategies. It was also observed that the user interests possess scale-free properties that can be used for the design of routing-based search strategies. In this paper, we show that the combination of these two properties enables the design of an efficient and simple fully decentralized search strategy. This search strategy is simple in the sense that it does not require maintaining any structured overlay network topology connecting the peers. It is efficient in the sense that simulations processed on real-world traces show that lookups perform in logarithmic expected number of steps.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abraham, I., Malkhi, D., Dobzinski, O.: LAND: Stretch (1 + _) locality-aware networks for DHTs. In: 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 550–559 (2004)Google Scholar
  2. 2.
    Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in power law networks. Physical Review E 64, 46135–46143 (2001)CrossRefGoogle Scholar
  3. 3.
  4. 4.
    Fraigniaud, P., Gauron, P.: An overview of the content addressable network D2B. In: Fraigniaud, P., Gauron, P. (eds.) Brief announcement at the 22nd ACM Symp. on Principles of Distributed Computing (PODC), p. 151 (2003)Google Scholar
  5. 5.
    Handurukande, S., Kermarrec, A.-M., Le-Fessant, F., Massoulié, L.: Exploiting Semantic Clustering in the eDonkey P2P Network. In: 11 th SIGOPS European Workshop (SIGOPS), pp. 109–114 (2004)Google Scholar
  6. 6.
    Kim, B., Yoon, C., Han, S., Jeong, H.: Path finding strategies in scale-free networks. Physical Review E 65, 027103-1–027103-4 (2002)Google Scholar
  7. 7.
    Le-Blond, S., Latapy, M., Guillaume, J.-L.: Statistical analysis of a P2P query graph based on degrees and their time evolution. In: 6 th Int. Workshop on Distributed Computing, IWDC (2004)Google Scholar
  8. 8.
    Le-Blond, S., Latapy, M., Guillaume, J.-L.: Clustering in P2P exchanges and consequences on performances. In: 4 th Int. Workshop on Peer-To-Peer Systems, IPTPS (2005)Google Scholar
  9. 9.
    Le-Fessant, F., Handurukande, S., Kermarrec, A.-M., Massoulié, L.: Clustering in Peer-to-Peer File Sharing Workloads. In: 3rd Int. Workshop on Peer-to-Peer Systems, IPTPS (2004)Google Scholar
  10. 10.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: 6th Int. Conf. on Supercomputing, pp. 84–95 (2002)Google Scholar
  11. 11.
    Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic lookup network. In: 21st Symp. on Principles of Distributed Computing, PODC (2002)Google Scholar
  12. 12.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161–172 (2001)Google Scholar
  13. 13.
    Sarshar, N., Boykin, P., Roychowdhury, V.: Percolation search in power law networks: making unstructured peer-to-peer networks scalable. In: 4th International Conference on Peer-to-Peer Computing, pp. 2–9 (2004)Google Scholar
  14. 14.
    Stoica, R., Morris, D., Karger, M.: Kaashoek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup service for Internet applications. In: SIGCOMM, pp. 149–160 (2001)Google Scholar
  15. 15.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: INFOCOM, pp. 2166–2176 (2003)Google Scholar
  16. 16.
    Voulgaris, S., Kermarrec, A.-M., Massoulié, L., van Steen, M.: Exploiting Semantic Proximity in Peer-to-peer Content Searching. In: 10 th IEEE Int. Workshop on Future Trends in Distributed Computing Systems (FTDCS), pp. 238–243 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pierre Fraigniaud
    • 1
  • Philippe Gauron
    • 2
  • Matthieu Latapy
    • 3
  1. 1.CNRS, LRIUniv. Paris-SudOrsayFrance
  2. 2.LRIUniv. Paris-SudOrsayFrance
  3. 3.CNRS, LIAFAUniv. Paris VIIParisFrance

Personalised recommendations