Skip to main content

A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault

  • Conference paper
  • First Online:
Book cover Structural Information and Communication Complexity (SIROCCO 2019)

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

  • 310 Accesses

Abstract

Self-stabilization [2] is a promising paradigm for designing distributed systems that are highly-tolerant of transient faults and adaptive to topology changes, since it guarantees that a system can recover its intended behavior even when its configuration (or global state) is arbitrarily changed by transient faults or topology changes. However, the recovery to the intended behavior requires a sufficiently long period of stable network environments (with no fault or topology changes). Self-stabilization guarantees nothing when the network has permanent faults or continuous topology changes. Thus, self-stabilization in the presence of permanent faults is a challenging and attractive issue.

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. Buhrman, H., Garay, J.A., Hoepman, J.H.: Optimal resiliency against mobile faults. In: Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers, pp. 83–88. IEEE (1995)

    Google Scholar 

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

    Article  Google Scholar 

  3. Dubois, S., Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. IEEE Trans. Parallel Distrib. Syst. 23(3), 460–466 (2012)

    Article  Google Scholar 

  4. Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems, pp. 22–29. IEEE (2002)

    Google Scholar 

Download references

Acknowledgment

This work was supported by JSPS KAKENHI Grant Numbers 17K19977, 18K18000, and 19K11826 and Japan Science and Technology Agency (JST) SICORP.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuichi Sudo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Inoue, K., Sudo, Y., Kakugawa, H., Masuzawa, T. (2019). A Strongly-Stabilizing Protocol for Spanning Tree Construction Against a Mobile Byzantine Fault. In: Censor-Hillel, K., Flammini, M. (eds) Structural Information and Communication Complexity. SIROCCO 2019. Lecture Notes in Computer Science(), vol 11639. Springer, Cham. https://doi.org/10.1007/978-3-030-24922-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-24922-9_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-24921-2

  • Online ISBN: 978-3-030-24922-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics