Cost Models and Performance Evaluation of Similarity Search in the HON P2P System

  • Mouna Kacimi
  • Kokou Yétongnon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4330)


Similarity searching is particularly important in fully distributed networks such as P2P systems in which various routing schemes are used to submit queries to a group of relevant nodes. This paper focuses on the maintenance cost models and performances of similarity search in the HON P2P system, where data and peers are organized in a high dimensional feature space. We show through extensive simulations that HON has a low maintenance cost and is resilient to peers’ failures.


Feature Space Maintenance Cost Fault Tolerance Zipf Distribution Cell Granularity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tang, C., Xu, Z., Mahalingam, M.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of ACM SIGCOMM, pp. 175–186 (2003)Google Scholar
  2. 2.
    Gnutella (2003),
  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, pp. 46–320. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149–160 (2001)Google Scholar
  5. 5.
    JXTA (2004),
  6. 6.
    Kacimi, M., Yetongnon, K.: Density-based clustering for similarity search in a p2p network. In: Proceedings of the 6th IEEE Symposium on Cluster Computing and the Grid (CCGrid 2006), pp. 57–64 (2006)Google Scholar
  7. 7.
    Li, M., Lee, W., Sivasubramaniam, A.: Semantic small world: An overlay network for peer-to-peer search. In: Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), pp. 228–238 (2004)Google Scholar
  8. 8.
    Rosch, P., Sattler, K.-U., Weth, C., Buchmann, E.: Best effort query processing in dht-based p2p systems. In: Proceedings of the 1st IEEE International Workshop on Networking Meets Databases (NetDB) (2005)Google Scholar
  9. 9.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mouna Kacimi
    • 1
  • Kokou Yétongnon
    • 1
  1. 1.Laboratoire LE2I, Sciences et TechniquesUniversity of BourgogneDijon CedexFrance

Personalised recommendations