Skip to main content
Springer Nature Link
Log in

A flexible DHT-based directory service for information management

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstracts

Information management is a key feature for the successful deployment of service architectures that involve highly distributed, dynamic, collaborative, and heterogeneous networks. Current solutions fail to meet important requirements of those networks since they have limited support for dynamicity of networks, nodes and information, or flexible information retrieval mechanisms for satisfying user’s needs. In this paper, we propose a Global Directory Service based on Distributed Hash Tables (DHT) and Hilbert Space Filling Curves (HSFC) that provides distribution and flexibility for information retrieval. Performance analyses reveal that the proposed mechanisms are scalable with the number of networks, nodes, and amount of information.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

Notes

  1. A similar space is delimited by the bounds formed by the range query shown in Fig. 12 but this one is more difficult to see as it is necessary a 32nd order Hilbert curve for a two-dimensional space.

References

  1. Andreolini M, Lancellotti R (2009) A flexible and robust lookup algorithm for P2P systems, In: IEEE international symposium on parallel. Distributed Processing, IPDPS 2009, Rome, pp 1–8

    Google Scholar 

  2. Baumgart, I., Heep, B., Krause, S., “OverSim: A Flexible Overlay Network Simulation Framework”, 10th IEEE Global Internet Symposium (GI ‘07), May 2007.

  3. Curbera F et al (2002) Unraveling the Web services Web: an introduction to SOAP, WSDL, and UDDI. Internet Computing 6(2):86–93

    Article  Google Scholar 

  4. DMTF (2014) Common Information Model (CIM) Specification, Version 2.40, Distributed Management Task Force, Available at http://dmtf.org/standards/cim/cim_schema_v2400.

  5. Dustdar S, Treiber M (2005) A view based analysis on Web service registries. Distributed and Parallel Databases 18(2):147–171

    Article  Google Scholar 

  6. IEEE Std 802.21 (2009) IEEE Standard for Local and Metropolitan Area Networks - Part 21: Media Independent Handover Services. IEEE.

  7. ITU-T (2005) Recommendation X.500 - The Directory: Overview of concepts, models and services. v. 08/2005.

  8. Joung, Y.-J., Yang, L.-W. (2014), On character-based index schemes for complex wildcard search in peer-to-peer networks, Inform. Sci., http://dx.doi.org/10.1016/j.ins.2014.02.095.

  9. Kamienski C, Sadok D (2004) The case for inter domain dynamic QoS-based service negotiation in the internet. Comput Commun 27(7):622–637

    Article  Google Scholar 

  10. Klampanosa IA, Jose JM (2012) Searching in peer-to-peer networks. Comput Sci Rev 6(4):161–183

    Article  Google Scholar 

  11. Lawder, J. K., King, P. J. H. (2000) Using Space-Filling Curves for Multi-dimensional Indexing. In: 17th British National Conference on Databases, BNCOD 2000, LNCS 1832:20–35 17.

  12. Moon B, Jagadish H, Faloutsos C, Saultz J (1996) Analysis of the clustering properties of the Hilbert space-filling curve. IEEE Trans Knowl Data Eng 13(1):124–141

    Article  Google Scholar 

  13. OASIS (2010). Universal Description Discovery and Integration. OASIS UDDI Version 3.0.2, July 2010.

  14. Park, V., Corson, M. (1997) A highly adaptive distributed routing algorithm for mobile wireless networks. 17th IEEE International Conference on Computer Communications. INFOCOM 97. 7–12 April 1997, Kobe, Japan, pp 1405–1413.

  15. Pentikousis K, Galis A, Agüero R (2009) Information management and sharing for ambient Multiaccess networks. Global Information Infrastructure Symposium, GIIS 2009, Hammamet, pp 23–26

    Google Scholar 

  16. Pitoura T, Ntarmos N, Triantafillou P (2012) Saturn: range queries, load balancing and fault tolerance in DHT data systems. IEEE Trans Knowl Data Eng 24(7):1313–1327

    Article  Google Scholar 

  17. Ratti, S., Hariri, B., Shirmohammadi, S. (2008) NL-DHT: A Non-uniform Locality Sensitive DHT Architecture for Massively Multi-user Virtual Environment Applications. In: 14th IEEE International Conference on Parallel and Distributed Systems. ICPADS 2008. Victoria, Australia. 8–10 December 2008.

  18. Rowstron, A., Druschel, P. (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, In: IFIP/ACM International Conference on Distributed Systems Platforms, Middleware ‘01, Heidelberg, Germany, 12–16 November 2001, pp 329–350.

  19. Schmidt CE, Parashar M (2004) A peer-to-peer approach to Web service discovery. World Wide Web 7(2):211–229

    Article  Google Scholar 

  20. Schmidt C, Parashar M (2008) Squid: enabling search in DHT-based systems. J Parallel Distrib Comput 68:962–975

    Article  MATH  Google Scholar 

  21. Sermersheim, J. (2006.) Lightweight Directory Access Protocol (LDAP): The Protocol, RFC 4511.

  22. Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) “Chord: a scalable Peer-to-Peer, lookup protocol for internet applications. ACM SIGCOMM 2001, San Diego, pp 149–160

    Google Scholar 

  23. Taniuchi K (2009) IEEE 802.21: media independent handover: features, applicability, and realization. IEEE Commun Mag 47(1):112–120

    Article  Google Scholar 

  24. Varga, A., Hornig, R. (2008) An overview of the OMNeT++ simulation environment. In: 1st international conference on Simulation tools and techniques for communications, Simutools ‘08, Marseille, France, 3–7 March 2008, art 60.

  25. Villaca, R., de Paula, R., Pasquini, R., Magalhaes, M. (2013) Hamming DHT: Taming the Similarity Search, In: IEEE Consumer Communications and Networking Conference. CCNC 2013. Las Vegas, USA, 11–14 January 2013, pp 7–12.

  26. Vu, Q.H., Lupu, M., Wu, S. (2009) SiMPSON: Efficient Similarity Search in Metric Spaces over P2P Structured Overlay Networks. In: 15th International Euro-Par Conference on Parallel Computing, Delft, The Netherlands, 25–28 August 2009, pp 498–510.

  27. Wei, X., Sezaki, K. (2006) DHR-Trees: a distributed multidimensional indexing structure for P2P systems. In: International Symposium on Parallel and Distributed Computing, ISPDC 2006, Timisoara, Romania, 6–9 July 2006, pp 281–290.

  28. Zhang C, Xiao W, Tang D, Tang J (2011) P2P-based multidimensional indexing methods: a survey. J Syst Softw 84(12):2348–2362

    Article  Google Scholar 

  29. Zhua Y, Hub Y (2007) Efficient semantic search on DHT overlays. J Parallel Distrib Comput 67(5):604–616

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal de Pernambuco, Recife, PE, Brazil

    Tarciana Silva, Stenio Fernandes & Djamel Sadok

  2. Universidade Federal do ABC, Santo André, SP, Brazil

    Carlos Kamienski

Authors
  1. Tarciana Silva
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Carlos Kamienski
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Stenio Fernandes
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Djamel Sadok
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Carlos Kamienski.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Silva, T., Kamienski, C., Fernandes, S. et al. A flexible DHT-based directory service for information management. Peer-to-Peer Netw. Appl. 8, 512–531 (2015). https://doi.org/10.1007/s12083-014-0277-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-014-0277-z

Keywords