Skip to main content

TLS: A Tree-Based DHT Lookup Service for Highly Dynamic Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3290))

Abstract

The P2P paradigm is increasingly receiving attention in many contexts such as Cooperative Information Systems. In this paper we present a P2P lookup service based on a hash table distributed on a hierarchical data structure (a forest). The novelty of our proposal is that it provides a dynamically adapting (to the number of peers) routing load biasing for decreasing the cost of peer insertion and deletion w.r.t. the state of the art. This makes our system particularly suited to very dynamic environments.

This work was partially funded by the Italian National Council Research under the “Reti Internet: efficienza, integrazione e sicurezza” project and by the European Union under the “SESTANTE – Strumenti Telematici per la Sicurezza e l’Efficienza Documentale della Catena Logistica di Porti e Interporti” Interreg III-B Mediterranee Occidentale project

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aberer, K.: P-grid: A self-organizing access structure for p2p information retrieval. In: Proceedings of the CoopIS, pp. 179–194 (2001)

    Google Scholar 

  2. Krishnamurthy, B., Xie, Y., Wang, J.: Early measurements of a cluster-based architecture for p2p systems. In: Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement, pp. 105–109. ACM Press, New York (2002)

    Google Scholar 

  3. Bolosky, W., Douceur, J., Ely, D., Theimer, M.: Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In: Proceedings of SIGMETRICS (2000)

    Google Scholar 

  4. Bradley, W.B., Maher, D.P.: The nemo p2p service orchestration framework. In: Proceedings of the 37th Annual Hawaii Int. Conf. on System Sciences (2004)

    Google Scholar 

  5. Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Logical foundations of peer to peer data integration. In: Proceedings of the Twenty third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2004)

    Google Scholar 

  6. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 407–418. ACM Press, New York (2003)

    Chapter  Google Scholar 

  7. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings of the IEEE Int. Conf. on Distributed Computing Systems, ICDCS 2002 (2002)

    Google Scholar 

  8. Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pp. 41–52. ACM Press, New York (2002)

    Chapter  Google Scholar 

  9. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of ASPLOS (2000)

    Google Scholar 

  10. Meghini, C., Tzitzikas, Y.: Query evaluation in peer-to-peer networks of taxonomy- based sources. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 263–281. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Philippe, P.F.: The content-addressable network d2b (2003)

    Google Scholar 

  12. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 161–172. ACM Press, New York (2001)

    Chapter  Google Scholar 

  13. Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg, pp. 329–350. Springer, Heidelberg (2001)

    Google Scholar 

  14. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 149–160. ACM Press, New York (2001)

    Chapter  Google Scholar 

  15. Marc Waldman, D.R., Cranor, L.F.: Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In: Proceedings of the 9th USENIX Security Symposium, pp. 59–72 (2000)

    Google Scholar 

  16. Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS 2002), p. 5. IEEE Computer Society, Los Alamitos (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buccafurri, F., Lax, G. (2004). TLS: A Tree-Based DHT Lookup Service for Highly Dynamic Networks. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. OTM 2004. Lecture Notes in Computer Science, vol 3290. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30468-5_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30468-5_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23663-4

  • Online ISBN: 978-3-540-30468-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics