Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Stabilizing, Safety, and Security of Distributed Systems

SSS 2018: Stabilization, Safety, and Security of Distributed Systems pp 239–253Cite as

Relays: A New Approach for the Finite Departure Problem in Overlay Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11201))

Abstract

A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests.

This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Center “On-The-Fly Computing” (SFB 901).

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

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

Learn about institutional subscriptions

References

  1. Aspnes, J., Wu, Y.: \(O(log n)\)-time overlay network construction from graphs with out-degree 1. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 286–300. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77096-1_21

    Chapter  Google Scholar 

  2. Augustine, J., Pandurangan, G., Robinson, P., Roche, S.T., Upfal, E.: Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In: Proceedings of the 56th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2015), pp. 350–369 (2015). https://doi.org/10.1109/FOCS.2015.29

  3. Berns, A., Ghosh, S., Pemmaraju, S.V.: Building self-stabilizing overlay networks with the transitive closure framework. Theor. Comput. Sci. 512, 2–14 (2013)

    Article  MathSciNet  Google Scholar 

  4. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)

    Article  Google Scholar 

  5. Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Stabilizing data-link over non-FIFO channels with optimal fault-resilience. Inf. Process. Lett. 111(18), 912–920 (2011). https://doi.org/10.1016/j.ipl.2011.06.010

    Article  MathSciNet  MATH  Google Scholar 

  6. Dolev, S., Hanemann, A., Schiller, E.M., Sharma, S.: Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 133–147. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33536-5_14

    Chapter  Google Scholar 

  7. Dolev, S., Kat, R.I.: Hypertree for self-stabilizing peer-to-peer systems. Distrib. Comput. 20(5), 375–388 (2008)

    Article  Google Scholar 

  8. Drees, M., Gmyr, R., Scheideler, C.: Churn- and DoS-resistant overlay networks based on network reconfiguration. In: Proc. of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), pp. 417–427 (2016). https://doi.org/10.1145/2935764.2935783

  9. Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., Strothmann, T.: On stabilizing departures in overlay networks. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 48–62. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11764-5_4

    Chapter  Google Scholar 

  10. Foreback, D., Nesterenko, M., Tixeuil, S.: Infinite unlimited churn (short paper). In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 148–153. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49259-9_12

    Chapter  Google Scholar 

  11. Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. Distrib. Comput. 25(4), 261–278 (2012)

    Article  Google Scholar 

  12. Jacob, R., Richa, A.W., Scheideler, C., Schmid, S., Täubig, H.: Skip\(^{+}\): a self-stabilizing skip graph. J. ACM 61(6), 36:1–36:26 (2014). https://doi.org/10.1145/2629695

    Article  MathSciNet  MATH  Google Scholar 

  13. Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: Towards higher-dimensional topological self-stabilization: a distributed algorithm for delaunay graphs. Theor. Comput. Sci. 457, 137–148 (2012)

    Article  MathSciNet  Google Scholar 

  14. Koutsopoulos, A., Scheideler, C., Strothmann, T.: Towards a universal approach for the finite departure problem in overlay networks. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 201–216. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21741-3_14

    Chapter  Google Scholar 

  15. Kuhn, F., Schmid, S., Wattenhofer, R.: Towards worst-case churn resistant peer-to-peer systems. Distrib. Comput. 22(4), 249–267 (2010)

    Article  Google Scholar 

  16. Nor, R.M., Nesterenko, M., Scheideler, C.: Corona: a stabilizing deterministic message-passing skip list. Theor. Comput. Sci. 512, 119–129 (2013). https://doi.org/10.1016/j.tcs.2012.08.029

    Article  MathSciNet  MATH  Google Scholar 

  17. Pandurangan, G., Robinson, P., Trehan, A.: DEX: self-healing expanders. In: Proceedings of the 28th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2014), pp. 702–711 (2014). https://doi.org/10.1109/IPDPS.2014.78

  18. Saia, J., Trehan, A.: Picking up the pieces: self-healing in reconfigurable networks. In: Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), pp. 1–12 (2008)

    Google Scholar 

  19. Scheideler, C., Setzer, A.: Relays: a new approach for the finite departure problem in overlay networks (full version). CoRR (2018). http://arxiv.org/abs/1809.05013

Download references

Author information

Authors and Affiliations

  1. Paderborn University, Paderborn, Germany

    Christian Scheideler & Alexander Setzer

Authors
  1. Christian Scheideler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Setzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Setzer .

Editor information

Editors and Affiliations

  1. Nagoya Institute of Technology, Nagoya, Japan

    Taisuke Izumi

  2. Telecom ParisTech, Paris, France

    Petr Kuznetsov

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Scheideler, C., Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: Izumi, T., Kuznetsov, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2018. Lecture Notes in Computer Science(), vol 11201. Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03232-6_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03231-9

  • Online ISBN: 978-3-030-03232-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation