Results 1  10
of
76
SelfStabilization by Local Checking and Correction
, 1997
"... this paper appeared in the 32nd Proceedings of the IEEE Foundations of Computer Science (FOCS) Conference, 1991. ..."
Abstract

Cited by 120 (29 self)
 Add to MetaCart
this paper appeared in the 32nd Proceedings of the IEEE Foundations of Computer Science (FOCS) Conference, 1991.
Uniform dynamic selfstabilizing leader election
 IEEE Transactions on Parallel and Distributed Systems
, 1997
"... Abstract—A distributed system is selfstabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The selfstabilization property makes the system tolerant to faults in which processors exhibit a ..."
Abstract

Cited by 100 (10 self)
 Add to MetaCart
Abstract—A distributed system is selfstabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The selfstabilization property makes the system tolerant to faults in which processors exhibit a faulty behavior for a while and then recover spontaneously in an arbitrary state. When the intermediate period in between one recovery and the next faulty period is long enough, the system stabilizes. A distributed system is uniform if all processors with the same number of neighbors are identical. A distributed system is dynamic if it can tolerate addition or deletion of processors and links without reinitialization. In this work, we study uniform dynamic selfstabilizing protocols for leader election under readwrite atomicity. Our protocols use randomization to break symmetry. The leader election protocol stabilizes in OaD'log nf time when the number of the processors is unknown and OaD'f, otherwise. Here D denotes the maximal degree of a node, ' denotes the diameter of the graph and n denotes the number of processors in the graph. We introduce selfstabilizing protocols for synchronization that are used as building blocks by the leaderelection algorithm. We conclude this work by presenting a simple, uniform, selfstabilizing ranking protocol. Index Terms—Selfstabilizing systems, leader election, distributed algorithms, randomized distributed algorithms, synchronization. 1
Faultlocal distributed mending
 In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing
, 1995
"... As communication networks grow, existing fault handling tools that involve global measures such as global timeouts or reset procedures become increasingly unaffordable, since their cost grows with the size of the network. Rather, for a fault handling mechanism to scale to large networks, its cost m ..."
Abstract

Cited by 62 (16 self)
 Add to MetaCart
As communication networks grow, existing fault handling tools that involve global measures such as global timeouts or reset procedures become increasingly unaffordable, since their cost grows with the size of the network. Rather, for a fault handling mechanism to scale to large networks, its cost must depend only on the number of failed nodes Žwhich, thanks to today’s technology, grows much more slowly than the networks.. Moreover, it should allow the nonfaulty regions of the networks to continue their operation even during the recovery of the faulty parts. This paper introduces the concepts fault locality and faultlocally mendable problems, which are problems for which there are correction algorithms Žapplied after faults. whose cost depends only on the Ž unknown. number of faults. We show that any inputoutput problem is faultlocally mendable. The solution involves a novel technique combining data structures and ‘‘local votes’ ’ among nodes, which may be of interest in itself. � 1999 Academic Press * Alexander Goldberg lecturer.
Time Optimal SelfStabilizing Spanning Tree Algorithms
 In FSTTCS93 Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, SpringerVerlag LNCS:761
, 1993
"... In this paper we present timeoptimal selfstabilizing algorithms for asynchronous distributed spanning tree computation in networks. ..."
Abstract

Cited by 60 (8 self)
 Add to MetaCart
In this paper we present timeoptimal selfstabilizing algorithms for asynchronous distributed spanning tree computation in networks.
StateOptimal SnapStabilizing PIF in Tree Networks (Extended Abstract)
 In Proceedings of the Fourth Workshop on SelfStabilizing Systems
, 1999
"... ) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snapstabilizing algorithm proto ..."
Abstract

Cited by 51 (26 self)
 Add to MetaCart
) Alain Bui, 1 Ajoy K. Datta, 2 Franck Petit, 1 Vincent Villain 1 1 LaRIA, Universit e de Picardie Jules Verne, France 2 Department of Computer Science, University of Nevada, Las Vegas Abstract In this paper, we introduce the notion of snapstabilization. A snapstabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snapstabilizing protocol is a selfstabilizing protocol which stabilizes in 0 steps. We propose a snapstabilizing Propagation of Information with Feedback (PIF) scheme on a rooted tree network. We call this scheme Propagation of information with Feedback and Cleaning (PFC). We present two algorithms. The first one is a basic PFC scheme which is inherently snapstabilizing. However, it can be delayed O(h 2 ) steps (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic PFC algori...
A LogStar Distributed Maximal Independent Set Algorithm . . .
 PODC'08
, 2008
"... We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growthbounded graphs (GBG) our deterministic algorithm finishes in O(log ∗ n) time, n being the number of nodes. In light of Linial’s Ω(log ∗ n) lower bound our algorithm is asymptotically optimal. Our algori ..."
Abstract

Cited by 46 (15 self)
 Add to MetaCart
We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growthbounded graphs (GBG) our deterministic algorithm finishes in O(log ∗ n) time, n being the number of nodes. In light of Linial’s Ω(log ∗ n) lower bound our algorithm is asymptotically optimal. Our algorithm answers prominent open problems in the ad hoc/sensor network domain. For instance, it solves the connected dominating set problem for unit disk graphs in O(log ∗ n) time, exponentially faster than the stateoftheart algorithm. With a new extension our algorithm also computes a δ + 1 coloring in O(log ∗ n) time, where δ is the maximum degree of the graph.
SelfStabilization by Local Checking and Global Reset (Extended Abstract)
, 1994
"... Baruch Awerbuch 12 , Boaz PattShamir 2 , George Varghese 3 and Shlomi Dolev 45 1 Dept. of Computer Science, Johns Hopkins University 2 Lab. for Computer Science, MIT 3 Dept. of Computer Science, Washington University 4 Dept. of Computer Science, Texas A&M University 5 School of Comp ..."
Abstract

Cited by 41 (11 self)
 Add to MetaCart
Baruch Awerbuch 12 , Boaz PattShamir 2 , George Varghese 3 and Shlomi Dolev 45 1 Dept. of Computer Science, Johns Hopkins University 2 Lab. for Computer Science, MIT 3 Dept. of Computer Science, Washington University 4 Dept. of Computer Science, Texas A&M University 5 School of Computer Science, Carleton University Abstract. We describe a method for transforming asynchronous network protocols into protocols that can sustain any transient fault, i.e., become selfstabilizing. We combine the known notion of local checking with a new notion of internal reset, and prove that given any selfstabilizing internal reset protocol, any locallycheckable protocol can be made selfstabilizing. Our proof is constructive in the sense that we provide explicit code. The method applies to many practical network problems, including spanning tree construction, topology update, and virtual circuit setup. 1 Introduction A network protocol is called selfstabilizing (or stabilizing for sho...
Local Stabilizer
 In Proceedings of the 5th Israel Symposium on Theory of Computing and Systems
, 1997
"... A local stabilizer protocol that takes any online or offline distributed algorithm and converts it into a synchronous selfstabilizing algorithm with local monitoring and repairing properties is presented. Whenever the selfstabilizing version enters an inconsistent state, the inconsistency is ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
A local stabilizer protocol that takes any online or offline distributed algorithm and converts it into a synchronous selfstabilizing algorithm with local monitoring and repairing properties is presented. Whenever the selfstabilizing version enters an inconsistent state, the inconsistency is detected, in O(1) time, and the system state is repaired in a local manner. The expected computation time that is lost during the repair process is proportional to the largest diameter of a faulty region. An extended abstract of this paper appeared in the Proc. of the 5th Israeli Symposium on Theory of Computing and Systems, June 1997 and a brief announcement in Proc. of the 16th Annual ACM Symp. on Principles of Distributed Computing, August 1997. y Computer Science Department, TelAviv University, TelAviv, 69978, Israel. Email: afek@math.tau.ac.il. z Department of Mathematics and Computer Science, BenGurion University, BeerSheva, 84105, Israel. Partially supported by the Israeli m...
Fast and lean selfstabilizing asynchronous protocols
 IN PROC. OF THE 35TH IEEE ANN. SYMP. ON FOUNDATION OF COMPUTER SCIENCE
, 1994
"... We consider asynchronous general topology dynamic networks of identical nameless nodes with worstcase transient faults. Starting from any faulty configuration, our protocols selfstabilize any computation in time polynomial in the (unknown) network diameter. This version sacrifices some diversity o ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
We consider asynchronous general topology dynamic networks of identical nameless nodes with worstcase transient faults. Starting from any faulty configuration, our protocols selfstabilize any computation in time polynomial in the (unknown) network diameter. This version sacrifices some diversity of tasks and efficiency for simplicity and clarity of details. Appendix gives more efficient procedures in less detail.