Skip to main content

Fully Distributed Indexing over a Distributed Hash Table

  • Conference paper
  • First Online:
Ubiquitous Networking (UNet 2017)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10542))

Included in the following conference series:

  • 1509 Accesses

Abstract

Real-time communication, as well as simple data and file sharing motivates relevant research in network design nowadays. While centralized structures are generally favored over distributed ones for sake of simplicity, a considerable amount of literature has been devoted to the latter. In particular, the problem of distributed indexing is not trivial, and has been addressed by extending classical data structures such as tries, kd-trees. However, all proposed solutions seem to assume that there is a central and unique entity handling the indexing. In this paper, we propose a fully distributed indexing strategy by extending a data structure called prefix hash tree (PHT). More precisely, in this strategy, each node is part of the distributed network and participates in maintaining the distributed index. Our ideas have been implemented in a freely available framework called OpenDHT.

GPG Key Fingerprint: 70B9 F71B 74C9 553D 01A1 A0EF 824A 8B97 F97E 4B08

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Commun. ACM 46(2), 43–48 (2003). ISSN 0001–0782. http://doi.acm.org/10.1145/606272.606299

    Article  Google Scholar 

  2. Bittorrent: The Bittorrent Protocol. http://www.bittorrent.org/

  3. Cohn-Gordon, K., Cremers, C., Dowling, B., Garratt, L., Stebila, D.: A formal security analysis of the signal messaging protocol (2016)

    Google Scholar 

  4. Gao, J., Steenkiste, P.: An adaptive protocol for efficient support of range queries in DHT-based systems. In: 12th IEEE International Conference on Network Protocols (ICNP 2004), 5–8 October 2004, Berlin, Germany, pp. 239–250 (2004). http://doi.ieeecomputersociety.org/10.1109/ICNP.2004.1348114

  5. Garcés-Erice, L., Felber, P., Biersack, E.W., Urvoy-Keller, G., Ross, K.W.: Data indexing in peer-to-peer DHT networks. In: ICDCS, pp. 200–208. IEEE Computer Society (2004)

    Google Scholar 

  6. Internet Engineering Task Force: Interactive connectivity establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols. https://tools.ietf.org/html/rfc5245

  7. Maymounkov P., Mazieres, D.: Kademlia: A Peer-to-peer Information System Based on the XOR Metric (2002). http://pdos.csail.mit.edu/~petar/papers/maymounkov-kademlia-lncs.pdf

  8. Ramabhadran, S., Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Prefix hash tree: an indexing data structure over distributed hash tables (2004)

    Google Scholar 

  9. Savoir-faire Linux: Ring/ring gives you a full control over your communications and an unmatched level of privacy. https://ring.cx/

  10. Savoir-faire Linux: A C++11 distributed hash table implementation (2016). http://opendht.net

  11. Shen, G., Zheng, C., Wei, P., Li, S.: Distributed segment tree: a unified architecture to support range query and cover query. Technical report MSR-TR-2007-30, Microsoft Research, March 2007. http://research.microsoft.com/apps/pubs/default.aspx?id=70419

  12. Sumbaly, R., Kreps, J., Gao, L., Feinberg, A., Soman, C., Shah, S.: Serving large-scale batch computed data with project Voldemort. In: Proceedings of the 10th USENIX Conference on File and Storage Technologies, FAST 2012, p. 18, Berkeley, CA, USA. USENIX Association (2012). http://dl.acm.org/citation.cfm?id=2208461.2208479

  13. Tang, Y., Xu, J., Zhou, S., Lee, W.-C.: m-LIGHT: indexing multi-dimensional data over DHTs. In: 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 22–26 June 2009, Montreal, Québec, Canada, pp. 191–198. IEEE Computer Society (2009). ISBN 978-0-7695-3659-0. http://dx.doi.org/10.1109/ICDCS.2009.30

  14. Wood, G.: Ethereum: A Secure Decentralised Generalised Transaction Ledger (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simon Désaulniers .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Désaulniers, S., Béraud, A., Blondin Massé, A., Reynaud, N. (2017). Fully Distributed Indexing over a Distributed Hash Table. In: Sabir, E., García Armada, A., Ghogho, M., Debbah, M. (eds) Ubiquitous Networking. UNet 2017. Lecture Notes in Computer Science(), vol 10542. Springer, Cham. https://doi.org/10.1007/978-3-319-68179-5_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68179-5_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68178-8

  • Online ISBN: 978-3-319-68179-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics