Skip to main content

Simulation Experiments of a Distributed Fault Containment Algorithm Using Randomized Scheduler

  • Conference paper
  • First Online:
Advanced Communication and Intelligent Systems (ICACIS 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1749))

  • 453 Accesses

Abstract

Fault containment is a critical component of stabilizing distributed systems. A distributed system is termed stabilizing (or self-stabilizing) if it exhibits two properties – a) convergence: a finite sequence of moves leading to a stable configuration, and b) closure: the system remains in that legitimate state unless another fault hits. In today’s world, the likelihood of several failures is quite low, and a single fault is far more likely to occur. The results of simulation experiment we did for single failure instances are presented in this study. For node selection, we employed a randomized scheduler. The results show that the fault containment mechanism we used restores valid configurations after a transient fault. The studies took into account variations in the number of nodes and the degree of the malfunctioning node. The results were graphically and numerically presented to provide relevant information. We can learn about the efficiency of our method by analyzing the simulation outcomes.

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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. Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)

    Book  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Gupta, A.: Fault-containment in self-stabilizing distributed systems, PhD Thesis, Department of Computer Science, The University of Iowa, Iowa City, IA (1997)

    Google Scholar 

  4. Dasgupta, A.: Extensions and refinements of stabilization, PhD Thesis, Department of Computer Science, The University of Iowa, Iowa City, IA (2009)

    Google Scholar 

  5. Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. self vs. probabilistic stabilization. In: Distributed Computing Systems, International Conference, Los Alamitos, CA, pp. 681–688 (2008)

    Google Scholar 

  6. Dasgupta, A., Ghosh, S., Xiao, X.: Fault-containment in weakly- stabilizing systems, Special Issue: Self-* Systems of Theoretical Computer Science (2011)

    Google Scholar 

  7. Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall, Hoboken (1974)

    MATH  Google Scholar 

  8. Andres, J., Fang, T., Nedbal, M.: Cable route planning and installation control: recent advances. Sub Optic 2007: Baltimore, Maryland (2007)

    Google Scholar 

  9. Fayyaz, M., Vladimirova, T.: Fault-tolerant distributed approach to satellite on-board computer design. In: IEEE Aerospace Conference, Big Sky, Montana (2014)

    Google Scholar 

  10. Dalichaouch, Y., Czipott, P.V., Perry, A.R.: Magnetic sensors for battlefield applications. Aerospace/Defense Sensing, Simulation, and Controls, Orlando, Florida (2001)

    Google Scholar 

  11. Chen, N.S., Yu, H.P., Huang, S.T.: A self-stabilizing algorithm for constructing spanning trees. Inf. Process. Lett. 39, 147–151 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dasgupta, A.: Selfish stabilization of maximum flow tree for two colored graphs. The Pennsylvania Association of Computer and Information Science Educators, California, PA (2014)

    Google Scholar 

  13. Cohen, J., Dasgupta, A., Ghosh, S., Tixeuil, S.: An exercise in selfish stabilization. ACM TAAS 3(4), 1–12 (2008)

    Article  Google Scholar 

  14. Hsu, S., Huang, S.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett. 43(2), 77–81 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Cobb, J.A., Gouda, M.G., Musunari, R.: A stabilizing solution to the stablepath problem. Self-Stabilizing Systems, San Francisco, CA, pp. 169–183 (2003)

    Google Scholar 

  16. Dasgupta, A., Ghosh, S., Xiao, X.: Probabilistic fault-containment. In: Masuzawa, T., Tixeuil, S. (eds.) Stabilization, Safety, and Security of Distributed Systems. LNCS, vol. 4838, pp. 189–203. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-76627-8_16

    Chapter  Google Scholar 

  17. JetBrains IntelliJ IDEA coding assistance and ergonomic design developer productivity website. https://www.jetbrains.com/idea/. Accessed30 Apr 2022

  18. Coursera learn without limits from world-class universities website. https://www.coursera.org/. Accessed 30 Apr 2022

  19. Edx the next era of online learning from world’s best institutions website. https://www.edx.org/. Accessed30 Apr 2022

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anurag Dasgupta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dasgupta, A., Tan, D., Majumder, K. (2023). Simulation Experiments of a Distributed Fault Containment Algorithm Using Randomized Scheduler. In: Shaw, R.N., Paprzycki, M., Ghosh, A. (eds) Advanced Communication and Intelligent Systems. ICACIS 2022. Communications in Computer and Information Science, vol 1749. Springer, Cham. https://doi.org/10.1007/978-3-031-25088-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-25088-0_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-25087-3

  • Online ISBN: 978-3-031-25088-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics