Self-Stabilization as a Foundation for Autonomic Computing

Brukman, Olga; Haviv, Yinnon; Yagel, Reuven

doi:10.1109/ares.2007.141

Cited by 7 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another paradigm for building distributed protocols in mobile ad hoc networks consists in designing self-stabilizing algorithms [6]. These algorithms have the ability to recover themselves from inconsistent states caused by transient failures that may affect a memory or a message.…”

Section: Introductionmentioning

confidence: 99%

Best-effort group service in dynamic networks

Ducourthial

Khalfallah

Petit

2010

Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We propose a group membership service for asynchronous wireless dynamic ad hoc networks. It maintains as long as possible the existing groups and ensures that the groups' diameters are always smaller than a constant, fixed according to applications requirements. The proposed protocol is self-stabilizing in a dynamic distributed system. Moreover, it ensures a continuity property, meaning that, while the system is converging, it does not run away, except if it is forced by a topology change.

show abstract

Section: Introductionmentioning

confidence: 99%

Best-effort group service in dynamic networks

Ducourthial

Khalfallah

Petit

2010

Proceedings of the Twenty-Second Annual ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…-Stabilizing trust and reputation for determining the amount of resources a guest will be granted. -Self-stabilization of these mechanisms and their composition [5,14] ensures that the system is eventually protected and functioning.…”

Section: Concepts For Fighting the Byzantinesmentioning

confidence: 99%

Stabilizing Trust and Reputation for Self-Stabilizing Efficient Hosts in Spite of Byzantine Guests (Extended Abstract)

Yagel

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This work presents a general and complete method to protect a system against possible malicious programs. We provide concepts for building a system that can automatically recover from an arbitrary state including even one in which a Byzantine execution of one or more programs repeatedly attempts to corrupt the system state. Preservation of a guest execution is guaranteed as long as the guest respects a predefined contract, while efficiency is improved by using stabilizing reputation. We augment a provable self-stabilizing host operating system implementation with a contract-enforcement framework example.

show abstract

Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems

Giavitto

Michel

Spicher

2008

Software-Intensive Systems and New Computing Paradigms

View full text Add to dashboard Cite

The chemical paradigm is an unconventional programming paradigm well fitted to the high-level specification of parallel systems. Based on the fixed point iterations of local rules, its use has been advocated for the programming of autonomic and amorphous systems . However, this model lacks an explicit handling of spatial relationships. In this contribution, we first show how the chemical paradigm can be extended beyond multisets to arbitrary topological collections . Topological collections handle in a uniform way sophisticated data structures required in algorithmics as well as distributed data structures needed for the programming of autonomic or amorphous systems. Then we adapt a well-known result on multiset ordering to the more general case of topological collections. Well-founded ordering on topological collection can be used to prove the termination of the fixed point iteration of local rules

show abstract

Self-Stabilization as a Foundation for Autonomic Computing

Cited by 7 publications

References 15 publications

Best-effort group service in dynamic networks

Best-effort group service in dynamic networks

Stabilizing Trust and Reputation for Self-Stabilizing Efficient Hosts in Spite of Byzantine Guests (Extended Abstract)

Spatial Organization of the Chemical Paradigm and the Specification of Autonomic Systems

Contact Info

Product

Resources

About