Skip to main content

A Decentralized Resilient Short-Term Cache for Messaging

  • Conference paper
  • First Online:
Distributed Applications and Interoperable Systems (DAIS 2018)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10853))

Abstract

Messaging applications are among the most popular internet applications and people use them worldwide on a daily basis. Their supporting infrastructure, though consisting of a multitude of servers, is typically under central control. This enables censorship and seamless user profiling. A fully decentralized infrastructure, with decentralized control and redundant data storage, can mitigate these dangers. In this paper we evaluate the basic ability of decentralized networks created by the network overlay and data storage protocol Kademlia to serve as a short-term data cache for messaging applications. Our results show, that reliable retrieval of up to 20 replicas is possible.

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. Cai, X.S., Devroye, L.: The analysis of kademlia for random IDs. Internet Math. 11(6), 572–587 (2015)

    Article  MathSciNet  Google Scholar 

  2. 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–66. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44702-4_4

    Chapter  Google Scholar 

  3. Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. Technical report (2004)

    Google Scholar 

  4. Fedotova, N., Fanti, S., Veltri, L.: Kademlia for data storage and retrieval in enterprise networks. In: CollaborateCom 2007, pp. 382–386. IEEE (2007)

    Google Scholar 

  5. Heck, H., Kieselmann, O., Wacker, A.: Evaluating connection resilience for self-organized cyber-physical systems. In: SASO 2016. IEEE, September 2016

    Google Scholar 

  6. Heck, H., Kieselmann, O., Wacker, A.: Evaluating Connection Resilience for the Overlay Network Kademlia. In: ICDCS, pp. 2581–2584. IEEE, Atlanta, June 2017

    Google Scholar 

  7. Azureus Software Inc.: Vuze wiki (2012). https://wiki.vuze.com/w/Distributed_hash_table#How_it_works. Accessed 5 July 2017

  8. Ji-Yi, W., Jian-Lin, Z., Tong, W., Qian-li, S.: Study on redundant strategies in peer to peer cloud storage systems. Appl. Math. Inf. Sci. 5(2), 235S–242S (2011)

    Google Scholar 

  9. Montresor, A., Jelasity, M.: Peersim: a scalable p2p simulator. In: P2P, pp. 99–100. IEEE (2009)

    Google Scholar 

  10. Montresor, A., Jelasity, M.: Peersim: A peer-to-peer simulator (2016). http://peersim.sourceforge.net/. Accessed 20 Feb 2018 and Accessed 1 Feb 2018

  11. Park, G.S., Song, H.: A novel hybrid P2P and cloud storage system for retrievability and privacy enhancement. Peer-to-Peer Netw. Appl. 9(2), 299–312 (2016)

    Article  Google Scholar 

  12. Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Comput. Netw. 50(17), 3485–3521 (2006)

    Article  Google Scholar 

  13. Roos, S., Nguyen, G.T., Strufe, T.: Integrating churn into the formal analysis of routing algorithms. In: International Conference and Workshops on Networked Systems (NetSys), 2015, pp. 1–5. IEEE (2015)

    Google Scholar 

  14. Roos, S., Salah, H., Strufe, T.: Determining the hop count in kademlia-type systems (2015)

    Google Scholar 

  15. Roos, S., Schiller, B., Hacker, S., Strufe, T.: Measuring freenet in the wild: censorship-resilience under observation. In: De Cristofaro, E., Murdoch, S.J. (eds.) PETS 2014. LNCS, vol. 8555, pp. 263–282. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08506-7_14

    Chapter  Google Scholar 

  16. Urdaneta, G., Pierre, G., Steen, M.V.: A survey of DHT security techniques. ACM Comput. Surv. (CSUR) 43(2), 8 (2011)

    Article  Google Scholar 

Download references

Acknowledgment

We thank the German Research Foundation (DFG) for their support within the project CYPHOC (WA 2828/1-1).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Henner Heck .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Heck, H., Kieselmann, O., Kopal, N., Wacker, A. (2018). A Decentralized Resilient Short-Term Cache for Messaging. In: Bonomi, S., Rivière, E. (eds) Distributed Applications and Interoperable Systems. DAIS 2018. Lecture Notes in Computer Science(), vol 10853. Springer, Cham. https://doi.org/10.1007/978-3-319-93767-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93767-0_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93766-3

  • Online ISBN: 978-3-319-93767-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics