Probabilistic Self-Stabilization
نویسندگان
چکیده
By using concrete scenarios, we present and discuss a new concept of probabilistic Self-Stabilization in Distributed Systems.
منابع مشابه
Stabilizing Maximal Independent Set in Unidirectional Networks is Hard
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this paper, we consider the problem of constructing self-stabilizingly a maximal independent set in uniform unidirectional networks of arbitrary shape. On the nega...
متن کاملOn Probabilistic Snap-Stabilization
In this paper, we introduce probabilistic snap-stabilization. We relax the definition of deterministic snap-stabilization without compromising its safety guarantees. In an unsafe environment, a probabilistically snap-stabilizing algorithm satisfies its safety property immediately after the last fault; whereas its liveness property is only ensured with probability 1. We show that probabilistic s...
متن کاملProbabilistic Self-Stabilization
A probabilistic self-stabilizing algorithm for a ring of identical processes is presented; the number of processes in the ring is odd, the processes operate synchronously, and communication is unidirectional in the ring. The normal function of the algorithm is to circulate a single token in the ring. If the initial state of the ring is abnormal, i.e. the number of tokens diiers from one, then e...
متن کاملProbabilistic Self-Stabilization and Biased Random Walks on Dynamic Graphs
A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to a legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers a legitimate computation, but only probabilistically, unlike a self-stabilizing system,...
متن کاملProbabilistic Self-Stabilization with Two-State Machines
We present and prove the correctness of a probabilistic self-stabilizing algorithm that circulates a token around an asynchronous ring of identical two-state machines. The number of machines in the ring is odd, and communication is unidirectional. If the initial state of the ring has more than one token, execution of the algorithm results probabilistically in convergence to a state with one tok...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.06707 شماره
صفحات -
تاریخ انتشار 2015