Results 1  10
of
28
Memory requirements for silent stabilization
, 1999
"... A stabilizing algorithm is silent if starting from an arbitrary state it converges to a global state after which the values stored in the communication registers are fixed. Many silent stabilizing algorithms have appeared in the literature. In this paper we show that there cannot exist constant mem ..."
Abstract

Cited by 71 (7 self)
 Add to MetaCart
A stabilizing algorithm is silent if starting from an arbitrary state it converges to a global state after which the values stored in the communication registers are fixed. Many silent stabilizing algorithms have appeared in the literature. In this paper we show that there cannot exist constant memory silent stabilizing algorithms for finding the centers of a graph, electing a leader, and constructing a spanning tree. We demonstrate a lower bound of Ω(log n) bits per communication register for each of the above tasks.
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 63 (29 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...
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 ..."
Abstract

Cited by 49 (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...
Memory space requirements for selfstabilizing leader election protocols
 IN PODC99 PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING
, 1999
"... We study the memory requirements of selfstabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and idbased systems. We consider two classes of protocols: deterministic ones and randomized ones. We prove that a nonconstant lower bound on t ..."
Abstract

Cited by 40 (19 self)
 Add to MetaCart
(Show Context)
We study the memory requirements of selfstabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and idbased systems. We consider two classes of protocols: deterministic ones and randomized ones. We prove that a nonconstant lower bound on the memory space is required by a SSLE protocol on unidirectional, anonymous rings (even if the protocol is randomized). We show that, if there is a deterministic protocol solving a problem on idbased systems where the processor memory space is constant and the idvalues are not bounded then there is a deterministic protocol on anonymous systems using constant memory space that solves the same problem. Thus impossibility results on anonymous rings (i.e. one may design a deterministic SSLE protocol, only on prime size rings, under a centralized daemon) can be extended to those kinds of idbased rings. Nevertheless, it is possible to design a silent and deterministic SSLE protocol requiring constant memory space on unidirectional, idbased rings where the idvalues are bounded. We present such a protocol. We also present a randomized SSLE protocol and a token circulation protocol under an unfair, distributed daemon on anonymous and unidirectional rings of any size. We give a lower bound on memory space requirement proving that these protocols are space optimal. The memory space required is constant on average.
Randomized Selfstabilizing and Space Optimal Leader Election under Arbitrary Scheduler on Rings
, 1999
"... We present a randomized selfstabilizing leader election protocol and a randomized selfstabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirectional rings of any size. These protocols are space optimal. We also give a formal and complete proof of these protocol ..."
Abstract

Cited by 30 (10 self)
 Add to MetaCart
We present a randomized selfstabilizing leader election protocol and a randomized selfstabilizing token circulation protocol under an arbitrary scheduler on anonymous and unidirectional rings of any size. These protocols are space optimal. We also give a formal and complete proof of these protocols.
SelfStabilizing DepthFirst Token Circulation In Arbitrary Rooted Networks
 Distributed Computing
, 1998
"... We present a deterministic distributed depthfirst token passing protocol on a rooted network. This protocol uses neither the processor identifiers nor the size of the network, but assumes the existence of a distinguished processor, called the root of the network. The protocol is selfstabilizing, m ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
We present a deterministic distributed depthfirst token passing protocol on a rooted network. This protocol uses neither the processor identifiers nor the size of the network, but assumes the existence of a distinguished processor, called the root of the network. The protocol is selfstabilizing, meaning that starting from an arbitrary state (in response to an arbitrary perturbation modifying the memory state), it is guaranteed to reach a state with no more than one token in the network. Our protocol implements a strictly fair token circulation scheme. The proposed protocol has extremely small state requirementonly 3(\Delta + 1) states per processor, i.e., O(log\Delta) bits per processor, where \Delta is the degree of the network. The protocol can be used to implement a strictly fair distributed mutual exclusion in any rooted network. This protocol can also be used to construct a DFS spanning tree. Keywords: Distributed mutual exclusion, selfstabilization, spanning tree, token passing. 1
A Survey of SelfStabilizing SpanningTree Construction Algorithms
, 2003
"... Selfstabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore wellsuited for dynamic, failure prone environments. Spanningtree construction in distributed systems is a fundamental task which forms the basis for many other network algorithm ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
(Show Context)
Selfstabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore wellsuited for dynamic, failure prone environments. Spanningtree construction in distributed systems is a fundamental task which forms the basis for many other network algorithms (like token circulation or routing). This paper surveys selfstabilizing algorithms that construct a spanning tree within a network of processing entities. Lower bounds and related work are also discussed.
Deterministic, Constant Space, SelfStabilizing Leader Election on Uniform Rings
 Proc. 9th International Workshop on Distributed Algorithms (WDAG '95), volume 972 of Lecture Notes in Computer Science
, 1995
"... We consider the problem of electing a leader on a ring of nameless processors by deterministic and selfstabilizing protocols. A processor can read the state of its neighbors (and its own state) to determine if it is enabled. A central demon (scheduler) picks an enabled processor to make an atomic m ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
(Show Context)
We consider the problem of electing a leader on a ring of nameless processors by deterministic and selfstabilizing protocols. A processor can read the state of its neighbors (and its own state) to determine if it is enabled. A central demon (scheduler) picks an enabled processor to make an atomic move. In an atomic move, the processor changes to a new state which is a function of its old state and the states of its two neighbors. It is well known that no deterministic protocol exists if n, the size of the ring is composite. If the size of the ring is a prime, surprisingly, there is a deterministic leader election protocol. In this paper, we present a protocol for bidirectional rings of prime size. Our protocol is deterministic, uses constant space and is selfstabilizing, in O(n 2 ) steps. 1 Introduction Selfstabilization is an abstraction of faulttolerance for transient faults. It guarantees that the system will eventually reache a legal configuration when started from an arbitr...
Stabilization of Maximal Metric Trees
 Workshop on SelfStabilizing Systems ’99
, 1999
"... We present a formal definition of routing metrics and provide the necessary and sufficient conditions for a routing metric to be optimizable along a tree. Based upon these conditions we present a generalization of the shortest path tree which we call the "maximal metric tree". We present a ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
We present a formal definition of routing metrics and provide the necessary and sufficient conditions for a routing metric to be optimizable along a tree. Based upon these conditions we present a generalization of the shortest path tree which we call the "maximal metric tree". We present a stabilizing protocol for constructing maximal metric trees. Our protocol demonstrates that the distancevector routing paradigm may be extended to any metric that is optimizable along a tree and in a selfstabilizing manner. Examples of maximal metric trees include shortest path trees (distancevector) , depth first search trees, maximum flow trees, and reliability trees. 1. Introduction A number of papers have addressed stabilizing spanning tree construction and selfstabilizing shortest path tree protocols may be found in [DIM93, AKY90, AKM93, AG94]. Although not always explicit about this, most of the stabilizing tree protocols in the literature are based upon a distancevector approach. In the di...
Multitolerance in Distributed Reset
 CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, SPECIAL ISSUE ON SELFSTABILIZATION
, 1998
"... A reset of a distributed system is safe if it does not complete "prematurely", i.e., without having reset some process in the system. Safe resets are possible in the presence of certain faults, such as process failstops and repairs, but are not always possible in the presence of more ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
A reset of a distributed system is safe if it does not complete "prematurely", i.e., without having reset some process in the system. Safe resets are possible in the presence of certain faults, such as process failstops and repairs, but are not always possible in the presence of more general faults, such as arbitrary transients. In this paper, we design a boundedmemory distributed reset program that possesses two tolerances: (i) in the presence of failstops and repairs, it always executes resets safely, and (ii) in the presence of a finite number of transient faults, it eventually executes resets safely. Designing this multitolerance in the reset program introduces the novel concern of designing a safety detector that is itself multitolerant. A broad application of our multitolerant safety detector is to make any total program likewise multitolerant.