Dynamic Querying in Structured Peer-to-Peer Networks

  • Domenico Talia
  • Paolo Trunfio
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5273)


Dynamic Querying (DQ) is a technique adopted in unstructured Peer-to-Peer (P2P) networks to minimize the number of peers that is necessary to visit to reach the desired number of results. In this paper we introduce the use of the DQ technique in structured P2P networks. In particular, we present a P2P search algorithm, named DQ-DHT (Dynamic Querying over a Distributed Hash Table), to perform DQ-like searches over DHT-based overlays. The aim of DQ-DHT is two-fold: allowing arbitrary queries to be performed in structured P2P networks, and providing dynamic adaptation of the search according to the popularity of the resources to be located. This paper describes the DQ-DHT algorithm using Chord as basic overlay and analyzes its performance in comparison with DQ in unstructured networks.


Span Tree Search Time Distribute Hash Table Broadcast Message Broadcast Algorithm 
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.


  1. 1.
    Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM 2001, San Diego, USA (2001)Google Scholar
  2. 2.
    Gnutella Protocol Development.
  3. 3.
    Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: 2nd IEEE Int. Conf. on Peer-to-Peer Computing (P2P 2002), Linköping, Sweden (2002)Google Scholar
  4. 4.
    Cai, M., Frank, M.R., Chen, J., Szekely, P.A.: MAAN: A Multi-Attribute Addressable Network for Grid Information Services. Journal of Grid Computing 2(1), 3–14 (2004)CrossRefzbMATHGoogle Scholar
  5. 5.
    Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 242–250. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Castro, M., Costa, M., Rowstron, A.: Debunking Some Myths About Structured and Unstructured Overlays. In: 2nd Symp. on Networked Systems Design and Implementation (NSDI 2005), Boston, USA (2005)Google Scholar
  7. 7.
    Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-like P2P Systems Scalable. In: ACM SIGCOMM 2003, Karlsruhe, Germany (2003)Google Scholar
  8. 8.
    El-Ansary, S., Alima, L., Brand, P., Haridi, S.: Efficient Broadcast in Structured P2P Networks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 304–314. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Fisk, A.: Gnutella Dynamic Query Protocol v0.1 (2003),
  10. 10.
    Castro, M., Costa, M., Rowstron, A.: Should we build Gnutella on a structured overlay? Computer Communication Review 34(1), 131–136 (2004)CrossRefGoogle Scholar
  11. 11.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  12. 12.
    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. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Zaharia, M., Keshav, S.: Gossip-based Search Selection in Hybrid Peer-to-Peer Networks. In: 5th Int. Workshop on Peer-to-Peer Systems (IPTPS 2006), Santa Barbara, USA (2006)Google Scholar
  14. 14.
    Chou, J.C.Y., Huang, T.-Y., Huang, K.-L., Chen, T.-Y.: SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol. IEEE Trans. Parallel Distrib. Syst. 17(5), 419–433 (2006)CrossRefGoogle Scholar
  15. 15.
    Preiss, B.R.: Data Structures and Algorithms with Object-Oriented Design Patterns in C++. John Wiley & Sons, Chichester (1998)Google Scholar
  16. 16.
    Binzenhöfer, A., Staehle, D., Henjes, R.: Estimating the size of a Chord ring. Technical Report 348, Institute of Computer Science, University of Würzburg (2005)Google Scholar
  17. 17.
    Jiang, H., Jin, S.: Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks. In: 13th IEEE Int. Conf. on Network Protocols (ICNP 2005), Boston, USA (2005)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Domenico Talia
    • 1
  • Paolo Trunfio
    • 1
  1. 1.DEIS, University of CalabriaRendeItaly

Personalised recommendations