Advertisement

RoBuSt: A Crash-Failure-Resistant Distributed Storage System

  • Martina Eikel
  • Christian Scheideler
  • Alexander Setzer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8878)

Abstract

In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to γn 1/loglogn crashed servers, with γ > 0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead.

Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS.

Keywords

Theory of Distributed Systems DHT Crash Failures Denial-of-Service Attacks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Awerbuch, B., Scheideler, C.: A Denial-of-Service Resistant DHT. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 33–47. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  2. 2.
    Baumgart, M., Scheideler, C., Schmid, S.: A dos-resilient information system for dynamic data management. In: Proc. SPAA, pp. 300–309 (2009)Google Scholar
  3. 3.
    Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., Thober, M.: Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting. In: Proc. of SPAA, pp. 170–179 (2004)Google Scholar
  4. 4.
    Cristian, F.: Understanding fault-tolerant distributed systems. Commun. ACM 34(2), 56–78 (1991)CrossRefGoogle Scholar
  5. 5.
    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, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Eikel, M., Scheideler, C., Setzer, A.: RoBuSt: A Crash-Failure-Resistant Distributed Storage System (full version). ArXiv e-prints (September 2014)Google Scholar
  7. 7.
    Eikel, M., Scheideler, C.: IRIS: A Robust Information System Against Insider DoS-Attacks. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 119–129. ACM (2013)Google Scholar
  8. 8.
    Gupta, I., Chandra, T.D., Goldszmidt, G.S.: On scalable and efficient distributed failure detectors. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, pp. 170–179. ACM, New York (2001)CrossRefGoogle Scholar
  9. 9.
    Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proc. of USITS, p. 9 (2003)Google Scholar
  10. 10.
    Kargl, F., Maier, J., Weber, M.: Protecting Web Servers from Distributed Denial of Service Attacks. In: Proc. of WWW, pp. 514–524 (2001)Google Scholar
  11. 11.
    Keromytis, A.D., Misra, V., Rubenstein, D.: SOS: Secure Overlay Services. In: Proc. of SIGCOMM, pp. 61–72 (2002)Google Scholar
  12. 12.
    Leners, J.B., Wu, H., Hung, W.-L., Aguilera, M.K., Walfish, M.: Detecting failures in distributed systems with the falcon spy network. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP 2011, pp. 279–294. ACM, New York (2011)Google Scholar
  13. 13.
    Morein, W.G., Stavrou, A., Cook, D.L., Keromytis, A.D., Misra, V., Rubenstein, D.: Using Graphic Turing Tests to Counter Automated DDoS Attacks Against Web Servers. In: Proc. of CCS, pp. 8–19 (2003)Google Scholar
  14. 14.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of SIGCOMM, pp. 161–172 (2001)Google Scholar
  15. 15.
    Sistla, A.P., Welch, J.L.: Efficient distributed recovery using message logging. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, PODC 1989, pp. 223–238. ACM, New York (1989)CrossRefGoogle Scholar
  16. 16.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Kalakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, Technical Report MIT (2002)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Martina Eikel
    • 1
  • Christian Scheideler
    • 1
  • Alexander Setzer
    • 1
  1. 1.University of PaderbornGermany

Personalised recommendations