Results 1  10
of
57
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 63 (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 61 (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...
Fast Distributed Construction of Small kDominating Sets and Applications
, 2000
"... This paper presents a fast distributed algorithm to compute a small kdominating set D (for any xed k) and its induced graph partition (breaking the graph into radius k clusters centered around the vertices of D). The time complexity of the algorithm is O(k log n). ..."
Abstract

Cited by 43 (7 self)
 Add to MetaCart
This paper presents a fast distributed algorithm to compute a small kdominating set D (for any xed k) and its induced graph partition (breaking the graph into radius k clusters centered around the vertices of D). The time complexity of the algorithm is O(k log n).
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...
Selfstabilization by Counter Flushing
 IN PODC94 PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING
, 1994
"... A useful way to design simple and robust protocols is to make them selfstabilizing. A protocol ..."
Abstract

Cited by 39 (5 self)
 Add to MetaCart
A useful way to design simple and robust protocols is to make them selfstabilizing. A protocol
TimeAdaptive Self Stabilization
, 1997
"... We study the scenario where a transient fault hit f of the n nodes of a distributed system by corrupting their state. We consider the basic persistent bit problem, where the system is required to maintain a 0/1 value in the face of transient failures by means of replication. We give an algorithm ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
We study the scenario where a transient fault hit f of the n nodes of a distributed system by corrupting their state. We consider the basic persistent bit problem, where the system is required to maintain a 0/1 value in the face of transient failures by means of replication. We give an algorithm to recover the value quickly: the value of the bit is recovered at all nodes in O(f) time units for an unknown f ! n=2. Moreover, complete state quiescence occurs in O(diam) time units, where diam denotes the actual diameter of the network. This means that the value persists indefinitely so long as any f ! n=2 faults are followed by \Omega\Gamma diam) faultfree time units. We prove matching lower bounds on both the output stabilization time and the state quiescence time. Using our persistent bit algorithm, we present a general transformer which takes a distributed nonreactive nonstabilizing protocol P , and produces a selfstabilizing protocol P 0 which solves the problem P solv...
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...
Optimal Time Self Stabilization in Dynamic Systems
 In WDAG93 Distributed Algorithms 7th International Workshop Proceedings, SpringerVerlag LNCS:725
, 1993
"... . A selfstabilizing system is a distributed system which can tolerate any number and any type of faults in the history. After the last fault occurs the system starts to converge to a legitimate behavior. The selfstabilization property is very useful for systems in which processors may malfunction ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
. A selfstabilizing system is a distributed system which can tolerate any number and any type of faults in the history. After the last fault occurs the system starts to converge to a legitimate behavior. The selfstabilization property is very useful for systems in which processors may malfunction for a while and then recover. When there is a long enough period during which no processor malfunctions the system stabilizes. Dynamic systems are systems in which communication links and processors may fail and recover during normal operation. Such failures could cause partitioning of the system communication graph. The application of selfstabilizing protocols to dynamic systems is natural. Following the last topology change each connected component of the system stabilizes independently. We present time optimal selfstabilizing dynamic protocols for a variety of tasks including: routing, leader election and topology update. The protocol for each of those tasks stabilizes in \Theta(d) ti...
Proof Labeling Schemes
 Proc. the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), Las Vegas
, 2005
"... This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification? ” and more specifically “how expensive is local verification compared to computation? ” A suitable model is introduced in which these questio ..."
Abstract

Cited by 22 (14 self)
 Add to MetaCart
This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification? ” and more specifically “how expensive is local verification compared to computation? ” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches are presented for the efficient construction of schemes, and upper and lower bounds are established on the cost of schemes for multiple basic problems. The paper also studies the role and cost of unique identities in terms of impossibility and complexity. Previous studies on related questions deal with distributed algorithms that simultaneously compute a configuration and verify that this configuration has a certain desired property. It turns out that this combined approach enables verification to be less costly, since the configuration is typically generated so as to be easily verifiable. In contrast, our approach separates the configuration design from the verification. That is, it first generates the desired configuration without bothering with the need to verify, and then handles the task of constructing a suitable verification scheme. Our approach thus allows for a more modular design of algorithms, and has the potential to aid in verifying properties even when the original design of the structures for maintaining them was done without verification in mind.