Optimal stabilizing of companion

Optimal Snap - Stabilizing Neighborood Synchronizerin

Self-Stabilizing Leader Election in Optimal Space

A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O(log n) space per process and stabilizes in O(n) rounds, where n is the number of processes in the network.

Time Optimal Synchronous Self Stabilizing Spanning Tree

This paper presents an improved and time-optimal self-stabilizing algorithm for a major task in distributed computinga rooted spanning tree construction. Our solution is decentralized (“truly distributed”), uses a bounded memory and is not based on the assumption that either n (the number of nodes), or diam (the actual diameter of the network), or an existence of cycles in the network are known...

Time Optimal Self-Stabilizing Spanning Tree Algorithms

This thesis presents time-optimal self-stabilizing algorithms for distributed spanning tree computation in asynchronous networks. We present both a randomized algorithm for anonymous networks as well as a deterministic version for ID-based networks. Our protocols are the rst to be time-optimal (i.e. stabilize in time O(diameter)) without any prior knowledge of the network size or diameter. Both...

Nearly Time Optimal Stabilizing Patchy Feedbacks

We consider the time optimal stabilization problem for a nonlinear control system ẋ = f(x, u). Let τ(y) be the minimum time needed to steer the system from the state y ∈ R to the origin, and call A(T ) the set of initial states that can be steered to the origin in time τ(y) ≤ T . Given any ε > 0, in this paper we construct a patchy feedback u = U(x) such that every solution of ẋ = f(x, U(x)), x...