Space-Efficient Fault-Containment in Dynamic Networks

  • Sven Köhler
  • Volker Turau
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6976)


Bounding the impact of transient small-scale faults by self”=stabilizing protocols has been pursued with independent objectives: Optimizing the system’s reaction upon topological changes (e.g. super”=stabilization), and reducing system recovery time from memory corruptions (e.g. fault”=containment). Even though transformations adding either super”=stabilization or fault”=containment to existing protocols exist, none of them preserves the other. This paper makes a first attempt to combine both objectives. We provide a transformation adding fault”=containment to silent self-stabilizing protocols while simultaneously preserving the property of self”=stabilization and the protocol’s behavior in face of topological changes. In particular, the protocol’s response to a topology change remains unchanged even if a memory corruption occurs in parallel to the topology change. The presented transformation increases the memory footprint only by a factor of 4 and adds \({\mathcal O}{1}\) bits per edge. All previously known transformations for fault”=containing self”=stabilization increase the memory footprint by a factor of 2m/n.


Lower Layer Minor Component Dynamic Network Middle Layer Primary State 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blin, L., Potop-Butucaru, M., Rovedakis, S., Tixeuil, S.: Loop-free super-stabilizing spanning tree construction. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 50–64. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Datta, A.K., Larmore, L., Piniganti, H.: Self-stabilizing leader election in dynamic networks. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 35–49. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans. on Parallel and Distributed Systems 19, 926–939 (2008)CrossRefzbMATHGoogle Scholar
  4. 4.
    Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)CrossRefzbMATHGoogle Scholar
  5. 5.
    Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science 1997(4) (1997)Google Scholar
  6. 6.
    Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing distributed protocols. Distributed Computing 20(1), 53–73 (2007)CrossRefzbMATHGoogle Scholar
  7. 7.
    Herman, T.: Superstabilizing mutual exclusion. Distributed Computing 13, 1–17 (2000)CrossRefGoogle Scholar
  8. 8.
    Katayama, Y., Ueda, E., Fujiwara, H., Masuzawa, T.: A latency optimal superstabilizing mutual exclusion protocol in unidirectional rings. Journal of Parallel and Distributed Computing 62(5), 865–884 (2002)CrossRefzbMATHGoogle Scholar
  9. 9.
    Köhler, S., Turau, V.: Fault-containing self-stabilization in asynchronous systems with constant fault-gap. In: Proceedings of the 30th IEEE International Conference on Distributed Computing Systems, pp. 418–427. IEEE Computer Society, Los Alamitos (2010)Google Scholar
  10. 10.
    Köhler, S., Turau, V.: A new technique for proving self-stabilization under the distributed scheduler. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 65–79. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  11. 11.
    Petcu, A., Faltings, B.: Superstabilizing, fault-containing distributed combinatorial optimization. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol. 1, pp. 449–454. AAAI Press, Menlo Park (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sven Köhler
    • 1
  • Volker Turau
    • 1
  1. 1.Institute of TelematicsHamburg University of TechnologyHamburgGermany

Personalised recommendations