Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Invited Paper: Reactive PLS for Distributed Decision

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2020)

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

  • 283 Accesses

Abstract

We generalize the definition of Proof Labeling Schemes to reactive systems, that is, systems where the configuration is supposed to keep changing forever. As an example, we address the main classical test case of reactive tasks, namely, the task of token passing. Different RPLSs are given for the cases that the network is assumed to be a tree or an anonymous ring, or a general graph, and the sizes of RPLSs’ labels are analyzed. We also address the question whether an RPLS exists. Interestingly, for the anonymous ring, it is known that no token passing algorithm is possible even if the number n is known. Nevertheless, we show that an RPLS is possible. We show that if one drops the assumption that n is known, the construction becomes impossible.

S. Dolev—work is supported by the Rita Altura Trust Chair in Computer Science, and is partially supported by a grant from the Ministry of Science and Technology, Israel & the Japan Science and Technology Agency (JST), and the German Research Funding (DFG, Grant#8767581199).

S. Kutten—The research of Shay Kutten was supported in part by a grant from the Hiroshi Fujiwara Cyber Security Research Center at the Technion.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Notes

  1. 1.

    Under some other definitions, then the predicate is computed on the whole state of the neighbor [3, 21, 33] or just variables on a specific port of an edge at a node and the neighbor at the other endpoint of that edge [6,7,8].

  2. 2.

    This may sound not unlike the claim that the world was created only a few thousand years ago, but created with a history built in, e.g., looks as if there were dinosaurs in time much older than a few thousand years ago.

  3. 3.

    A non-distributed marker may also be useful in some settings.

References

  1. Afek, Y., Dolev, S.: Local stabilizer. J. Parallel Distrib. Comput. 62(5), 745–765 (2002)

    Article  MATH  Google Scholar 

  2. Afek, Y., Kutten, S., Yung, M.: Memory-efficient self stabilizing protocols for general networks. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 15–28. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-54099-7_2

    Chapter  Google Scholar 

  3. Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its applications to self-stabilization. Theoret. Comput. Sci. 186(1–2), 199–229 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Awerbuch, B., Goldreich, O., Vainish, R., Peleg, D.: A trade-off between information and communication in broadcast protocols. J. ACM (JACM) 37(2), 238–256 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  5. Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 652–661 (1993)

    Google Scholar 

  6. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. FOCS. 91, 268–277 (1991)

    Google Scholar 

  7. Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilization by local checking and global reset. In: Tel, G., Vitányi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 326–339. Springer, Heidelberg (1994). https://doi.org/10.1007/BFb0020443

    Chapter  Google Scholar 

  8. Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. FOCS 91, 258–267 (1991)

    Google Scholar 

  9. Balliu, A., Brandt, S., Olivetti, D., Suomela, J.: How much does randomness help with locally checkable problems? In: Proceedings of the 39th Symposium on Principles of Distributed Computing, pp. 299–308 (2020)

    Google Scholar 

  10. Beauquier, J., Delaët, S., Dolev, S., Tixeuil, S.: Transient fault detectors. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 62–74. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0056474

    Chapter  Google Scholar 

  11. Beauquier, J., Pilard, L., Rozoy, B.: Observing locally self-stabilization. J. High Speed Netw. 14(1), 3–19 (2005)

    MATH  Google Scholar 

  12. Beauquier, J., Pilard, L., Rozoy, B.: Observing locally self-stabilization in a probabilistic way. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 399–413. Springer, Heidelberg (2005). https://doi.org/10.1007/11561927_29

    Chapter  Google Scholar 

  13. Burns, J.E., Pachl, J.K.: Uniform self-stabilizing rings. ACM Trans. Programm. Lang. Syst. (TOPLAS) 11(2), 330–344 (1989)

    Article  Google Scholar 

  14. Chandy, K.M., Lamport, L.: Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985)

    Article  Google Scholar 

  15. DĂ©fago, X., Emek, Y., Kutten, S., Masuzawa, T., Tamura, Y.: Communication efficient self-stabilizing leader election. arXiv preprint arXiv:2008.04252 (2020)

  16. Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119–133. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0056478

    Chapter  Google Scholar 

  17. Dijkstra, E.W.: Self-stabilization in spite of distributed control. In: Selected Writings on Computing: A Personal Perspective, pp. 41–46. Springer (1982). https://doi.org/10.1007/978-1-4612-5695-3_7

  18. Dolev, S., Israeli, A., Moran, S.: Self stabilization of dynamic systems. In: Proceedings of the MCC Workshop on Self-Stabilizing Systems, Microelectronics and Computer Technology Corporation. Technical report Number STP-379-89, Austin (1989)

    Google Scholar 

  19. Dolev, S., Israeli, A., Moran, S.: Self stabilization of dynamic systems assuming only read write atomicity. Distrib. Comput. 7, 3–16 (1993)

    Article  MATH  Google Scholar 

  20. Dolev, S.: Self-Stabilization. MIT press, Cambridge (2000)

    Google Scholar 

  21. Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Informatica 36(6), 447–462 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  22. Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. In: Proceedings of the Fourteenth ACM PODC, p. 255 (1995)

    Google Scholar 

  23. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distrib. Comput. 7(1), 3–16 (1993)

    Article  MATH  Google Scholar 

  24. Dolev, S., Tzachar, N.: Randomization adaptive self-stabilization. Acta informatica 47(5–6), 313–323 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  25. Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. Theoret. Comput. Sci. 412(24), 2642–2656 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  26. Even, G., et al.: Three notes on distributed property testing. In: 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  27. Feuilloley, L., Fraigniaud, P., Hirvonen, J.: A hierarchy of local decision. arXiv preprint arXiv:1602.08925 (2016)

  28. Flocchini, P., Mans, B., Santoro, N.: Sense of direction in distributed computing. Theoret. Comput. Sci. 291(1), 29–53 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  29. Foerster, K.T., Richter, O., Seidel, J., Wattenhofer, R.: Local checkability in dynamic networks. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, pp. 1–10 (2017)

    Google Scholar 

  30. Fraigniaud, P., Korman, A., Peleg, D.: Towards a complexity theory for local distributed computing. J. ACM (JACM) 60(5), 1–26 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  31. Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. Proc. ACM PODC 1996, 45–54 (1996)

    MATH  Google Scholar 

  32. Ginat, D., Sleator, D.D., Tarjan, R.E.: A tight amortized bound for path reversal. Inf. Process. Lett. 31(1), 3–5 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  33. Göös, M., Suomela, J.: Locally checkable proofs in distributed computing. Theory Comput. 12(1), 1–33 (2016)

    MathSciNet  MATH  Google Scholar 

  34. Katz, S., Perry, K.J.: Self-stabilizing extensions for meassage-passing systems. Distrib. Comput. 7(1), 17–26 (1993)

    Article  MATH  Google Scholar 

  35. Kol, G., Oshman, R., Saxena, R.R.: Interactive distributed proofs. In: Proceedings of the 2018 ACM PODC, pp. 255–264 (2018)

    Google Scholar 

  36. Kor, L., Korman, A., Peleg, D.: Tight bounds for distributed MST verification (2011)

    Google Scholar 

  37. Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distrib. Comput. 22(4), 215–233 (2010)

    Article  MATH  Google Scholar 

  38. Kutten, S., Patt-Shamir, B.: Time-adaptive self stabilization. In: Proceedings of the Sixteenth ACM PODC, pp. 149–158 (1997)

    Google Scholar 

  39. Lamport, L.: The mutual exclusion problem: Part II-statement and solutions. J. ACM 33(2), 327–348 (1986). https://doi-org.ezlibrary.technion.ac.il/10.1145/5383.5385

  40. Lin, C., Simon, J.: Observing self-stabilization. In: Proceedings of the Eleventh ACM PODC, pp. 113–123 (1992)

    Google Scholar 

  41. Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  42. Naor, M., Parter, M., Yogev, E.: The power of distributed verifiers in interactive proofs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1096–1115. SIAM (2020)

    Google Scholar 

  43. Naor, M., Stockmeyer, L.: What can be computed locally? SIAM J. Comput. 24(6), 1259–1277 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  44. Onus, M., Richa, A., Scheideler, C.: Linearization: locally self-stabilizing sorting in graphs. In: 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 99–108. SIAM (2007)

    Google Scholar 

  45. Sarma, A.D., et al.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235–1265 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  46. Welch, J.L., Walter, J.E.: Link reversal algorithms. Synth. Lect. Distrib. Comput. Theory 2(3), 1–103 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technion - Israel Institute of Technology, Haifa, Israel

    Jiaqi Chen & Shay Kutten

  2. Ben-Gurion University of the Negev, 84105, Beer-Sheva, Israel

    Shlomi Dolev

Authors
  1. Jiaqi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shlomi Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shay Kutten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiaqi Chen .

Editor information

Editors and Affiliations

  1. Grenoble Alpes University, Saint Martin d'Hères, France

    Stéphane Devismes

  2. The University of Texas at Austin, Richardson, TX, USA

    Neeraj Mittal

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, J., Dolev, S., Kutten, S. (2020). Invited Paper: Reactive PLS for Distributed Decision. In: Devismes, S., Mittal, N. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2020. Lecture Notes in Computer Science(), vol 12514. Springer, Cham. https://doi.org/10.1007/978-3-030-64348-5_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-64348-5_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-64347-8

  • Online ISBN: 978-3-030-64348-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation