Results 1 
5 of
5
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 24 (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.
Slide  The Key to Polynomial EndtoEnd Communication
, 1997
"... We consider the basic task of of endtoend communication in dynamic networks, that is, delivery in finite time, of data items generated online by a sender, to a receiver, in order and without duplication or omission. ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We consider the basic task of of endtoend communication in dynamic networks, that is, delivery in finite time, of data items generated online by a sender, to a receiver, in order and without duplication or omission.
Distributed Synchronization Protocols for SDH Networks
, 1995
"... In this paper we design distributed protocols for synchronization in SDH networks. We start by suggesting a new abstraction to model the communication of control information in SDH/SONET frame headers. The new model is then used in the construction of realistic and faulttolerant distributed protoco ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we design distributed protocols for synchronization in SDH networks. We start by suggesting a new abstraction to model the communication of control information in SDH/SONET frame headers. The new model is then used in the construction of realistic and faulttolerant distributed protocols for the timing distribution problem. In this problem the nodes of an SDH/SONET network should be synchronized to transmit at the same rate; otherwise the data carried by the network may be impaired. The presented protocols ensure that (1) all the nodes derive their transmission clock from one source, (2) that this source is the highest quality clock available in the network and (3) that the path along which the clock at a node is derived is the shortest path from the source to the node. The design of the presented protocol employs modern techniques from the field of distributed computing adapted to the model and tools available in a real SDH/SONET network. Keywords: Synchronization, SDH, ...
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...