Advertisement

Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback

  • Jordan Adamek
  • Mikhail Nesterenko
  • Sébastien Tixeuil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)

Abstract

We simulate a stabilizing propagation of information with feedback (PIF) program to evaluate its response to perturbations. Under several classic execution models, we vary the extent of the fault as well as the system scale. We study the program’s speed of stabilization and overhead incurred by the fault. Our simulation provides insight into practical program behavior that is sometimes lacking in theoretical correctness proofs. This indicates that such simulation is a useful research tool in studies of fault tolerance.

Keywords

Stabilization Time Fault Rate Random Initial State Legitimate State Execution Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Distributed Computing 20(1), 3–19 (2007)Google Scholar
  2. 2.
    Dolev, S.: Self-Stabilization. MIT Press (2000)Google Scholar
  3. 3.
    Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. Technical Report 1110.0334, ArXiv eprint (October 2011)Google Scholar
  4. 4.
    Flatebo, M., Datta, A.K.: Simulation of self-stabilizing algorithms in distributed systems. In: Proceedings of the 25th Annual Simulation Symposium, pp. 32–41 (1992)Google Scholar
  5. 5.
    Johnen, C., Mekhaldi, F.: Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part I. LNCS, vol. 6852, pp. 117–129. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  6. 6.
    Mitton, N., Séricola, B., Tixeuil, S., Fleury, E., Guérin-Lassous, I.: Self-stabilization in self-organized multihop wireless networks. Ad Hoc and Sensor Wireless Networks 11(1-2), 1–34 (2011)Google Scholar
  7. 7.
    Mullner, N., Dhama, A., Theel, O.: Derivation of fault tolerance measures of self-stabilizing algorithms by simulation. In: 41st Annual Simulation Symposium, ANSS 2008, pp. 183–192 (April 2008)Google Scholar
  8. 8.
    Nesterenko, M., Tixeuil, S.: Ideal stabilization. Journal of Utility and Grid Computing (JUGC) (to appear, 2012)Google Scholar
  9. 9.
    Nesterenko, M., Tixeuil, S.: Proof of stabilization of ideal propagation of information with feedback algorithm. Technical Report TR-KSU-CS-2012-1, Computer Science Department, Kent State University (April 2012)Google Scholar
  10. 10.
    Prüfer, A.: Neuer beweis eines Satzes über permutationen. Archiv für Mathematik Physik 27, 122–142 (1918)Google Scholar
  11. 11.
    Tel, G.: Introduction to distributed algorithms. Cambridge University Press (1994)Google Scholar
  12. 12.
    Tixeuil, S.: Self-stabilizing Algorithms. In: Algorithms and Theory of Computation Handbook, 2nd edn., pp. 26.1–26.45. CRC Press, Taylor & Francis Group (November 2009)Google Scholar
  13. 13.
    Wahba, S.K., Hallstrom, J.O., Srimani, P.K., Sridhar, N.: SFS 3: a simulation framework for self-stabilizing systems. In: McGraw, R.M., Imsand, E.S., Chinni, M.J. (eds.) Proceedings of the 2010 Spring Simulation Multiconference, SpringSim 2010, Orlando, Florida, USA, April 11-15, pp. 172–181. SCS/ACM (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jordan Adamek
    • 1
  • Mikhail Nesterenko
    • 1
  • Sébastien Tixeuil
    • 2
  1. 1.Kent State UniversityUSA
  2. 2.UPMC Sorbonne Universités & IUFFrance

Personalised recommendations