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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bui, A., Datta, A.K., Petit, F., Villain, V.: Snap-stabilization and PIF in tree networks. Distributed Computing 20(1), 3–19 (2007)
Dolev, S.: Self-Stabilization. MIT Press (2000)
Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. Technical Report 1110.0334, ArXiv eprint (October 2011)
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)
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)
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)
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)
Nesterenko, M., Tixeuil, S.: Ideal stabilization. Journal of Utility and Grid Computing (JUGC) (to appear, 2012)
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)
Prüfer, A.: Neuer beweis eines Satzes über permutationen. Archiv für Mathematik Physik 27, 122–142 (1918)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press (1994)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adamek, J., Nesterenko, M., Tixeuil, S. (2012). Evaluating Practical Tolerance Properties of Stabilizing Programs through Simulation: The Case of Propagation of Information with Feedback. In: Richa, A.W., Scheideler, C. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2012. Lecture Notes in Computer Science, vol 7596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33536-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-33536-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33535-8
Online ISBN: 978-3-642-33536-5
eBook Packages: Computer ScienceComputer Science (R0)