Results 1 
2 of
2
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 29 (10 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 &quot;dynamic selfstabilizing networks. &quot; 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.
On Distributed Verification
, 2006
"... This paper describes the invited talk given at the 8th International ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper describes the invited talk given at the 8th International