Results 1 
6 of
6
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.
The Local Detection Paradigm and its Applications to SelfStabilization
"... A new paradigm for the design of selfstabilizing distributed algorithms, called local detection, is introduced. The essence of the paradigm is in defining a local condition based on the state of a processor and its immediate neighborhood, such that the system is in a globally legal state if and onl ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
A new paradigm for the design of selfstabilizing distributed algorithms, called local detection, is introduced. The essence of the paradigm is in defining a local condition based on the state of a processor and its immediate neighborhood, such that the system is in a globally legal state if and only if the local condition is satisfied at all the nodes. In this work we also extend the model of selfstabilizing networks traditionally assuming memory failure to include the model of dynamic networks (assuming edge failures and recoveries). We apply the paradigm to the extended model which we call "dynamic selfstabilizing networks. " Without loss of generality, we present the results in the least restrictive shared memory model of read/write atomicity, to which end we construct basic information transfer primitives. Using local detection, we develop deterministic and randomized selfstabilizing algorithms that maintain a rooted spanning tree in a general network whose topology changes dynamically. The deterministic algorithm assumes unique identities while the randomized assumes an anonymous network. The algorithms use a constant number of memory words per edge in each node; and both The size of memory words and of messages is the number of bits necessary to represent a node identity (typically O(log n) bits where n is the size of the network). These algorithms provide for the easy construction of selfstabilizing protocols for numerous tasks: reset, routing, topologyupdate and selfstabilization transformers that automatically selfstabilize existing protocols for which local detection conditions can be defined.
SelfStabilizing Algorithms for Synchronous Unidirectional Rings (Extended Summary)
, 1996
"... In this work we investigate the notion of builtin faulttolerant (i.e. selfstabilizing) computations on a synchronous uniform unidirectional ring network. Our main result is a protocolcompiler that transforms any selfstabilizing protocol P for a (synchronous or asynchronous) bidirectional ring to ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
In this work we investigate the notion of builtin faulttolerant (i.e. selfstabilizing) computations on a synchronous uniform unidirectional ring network. Our main result is a protocolcompiler that transforms any selfstabilizing protocol P for a (synchronous or asynchronous) bidirectional ring to a selfstabilizing protocol P 0 which runs on the synchronous unidirectional ring. P 0 requires O(SLE (n)+S(n)) space and has expected stabilization time O(TLE (n) + n 2 + nT (n)), where S(n) (T (n)) is the space (time) performance of P and SLE (n) (TLE (n)) is the space (time) performance of a selfstabilizing leaderelection protocol on a bidirectional ring. As subroutines, we also solve the problems of leader election and roundrobin token management in our setting. 1 Introduction The design of efficient distributed algorithms for unidirectional networks has proven to be a difficult task. There are only a few known protocols, e.g., [15, 31, 2, 25, 16, 28] and most of them do no...
Scalable Fault Tolerance
 SOFSEM, LNCS 1175
, 1996
"... Abstract. As communication networks grow, existing fault handling tools become increasingly unaffordable. In many cases the reason is that they involve global measures such as global timeouts or reset procedures, and their cost grows with the size of the network. Rather, for a fault handling mecha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. As communication networks grow, existing fault handling tools become increasingly unaffordable. In many cases the reason is that they involve global measures such as global timeouts or reset procedures, and their cost grows with the size of the network. Rather, for a fault handling mechanism to scale to large networks, it should involve local measures, or, at worse, fault local measures, i.e. measures the cost of which depends only on the number of failed nodes (which, thanks to today's technology, grows much slower than the networks). This decreases the recovery time and, moreover, often allows the nonfaulty regions of the networks to continue their operation even during the recovery of the faulty parts. We describe several research ideas that lead in this direction. 1
On Distributed Verification
, 2006
"... This paper describes the invited talk given at the 8th International ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes the invited talk given at the 8th International
The Local Detection Paradigm for Self Stabilization to Self Stabilization
, 1994
"... A new paradigm for the design of selfstabilizing distributed algorithms, called local detection, is introduced. The paradigm is to define a condition that each node can check locally, such that the condition holds for every node in its immediate neighborhood if and only if the system is in a glo ..."
Abstract
 Add to MetaCart
A new paradigm for the design of selfstabilizing distributed algorithms, called local detection, is introduced. The paradigm is to define a condition that each node can check locally, such that the condition holds for every node in its immediate neighborhood if and only if the system is in a globally legal state. Following our preliminary presentation [AKY90], this paradigm has been widely used and further studied in recent works, (e.g., in [Var92, A94, AV91, APSV91, AKM + 93, AO94, IL94]). The second conceptual contribution is that we require a selfstabilizing protocol model that generalizes the model of dynamic networks, where initially noticeable topological changes take place in the network (thus combining dynamic networks and selfstabilizing protocols that traditionally overcome memory errors). Based on the paradigm and in the extended model, we develop a selfstabilizing algorithm that maintains a rooted spanning tree in a general network. This algorithm can ove...