Results 1  10
of
18
Service Time Optimal SelfStabilizing Token Circulation Protocol on Anonymous Unidrectional Rings
 In SRDS 2002 21st Symposium on Reliable Distributed Systems, IEEE Computer
, 2002
"... on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm).
A Space Optimal, Deterministic, SelfStabilizing, Leader Election Algorithm for Unidirectional Rings
"... A new, selfstabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
A new, selfstabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous selfstabilizing algorithms for this problem.
Randomized Dining Philosophers Without Fairness Assumption
 IN PROCEEDINGS OF 2ND IFIP INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE (TCS
, 2001
"... We consider LehmannRabin's randomized solution to the wellknown problem of the dining philosophers. Up to now, such an analysis has always required a "fairness" assumption on the scheduler: if a philosopher is continuously hungry then he must eventually be scheduled. In contrast here, we modify th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider LehmannRabin's randomized solution to the wellknown problem of the dining philosophers. Up to now, such an analysis has always required a "fairness" assumption on the scheduler: if a philosopher is continuously hungry then he must eventually be scheduled. In contrast here, we modify the algorithm in order to get rid of the fairness assumption. We claim that the spirit of the original algorithm is preserved. We prove that, for any (possibly unfair) scheduler, the modified algorithm converges: every computation reaches with probability 1 a configuration where some philosopher eats. Furthermore, we are now able to evaluate the expected time of convergence as a number of transitions. We show that, for some "malicious" scheduler, this expected time is at least exponential in the number N of philosophers.
Weak vs. Self vs. Probabilistic Stabilization
"... Selfstabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a co ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Selfstabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weakstabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that selfstabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weakstabilizing protocol can be turned into a probabilistic selfstabilizing one. This latter result hints at more practical use of weakstabilization, as such algorithms are easier to design and prove than their (probabilistic) selfstabilizing counterparts. 1.
Constantspace Localized Byzantine Consensus
"... Abstract. Adding Byzantine tolerance to large scale distributed systems is considered nonpractical. The time, message and space requirements are very high. Recently, researches have investigated the broadcast problem in the presence of a fℓlocal Byzantine adversary. The local adversary cannot cont ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Adding Byzantine tolerance to large scale distributed systems is considered nonpractical. The time, message and space requirements are very high. Recently, researches have investigated the broadcast problem in the presence of a fℓlocal Byzantine adversary. The local adversary cannot control more than fℓ neighbors of any given node. This paper proves sufficient conditions as to when the synchronous Byzantine consensus problem can be solved in the presence of a fℓlocal adversary. Moreover, we show that for a family of graphs, the Byzantine consensus problem can be solved using a relatively small number of messages, and with time complexity proportional to the diameter of the network. Specifically, for a family of boundeddegree graphs with logarithmic diameter, O(log n) time and O(n log n) messages. Furthermore, our proposed solution requires constant memory space at each node. This is the author’s copy of the paper. Please see
Optimization of Service Time and Memory Space in a SelfStabilizing Token Circulation Protocol on Anonymous Unidirectional Rings
, 2002
"... We present a selfstabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The algorithm can deal with any kind of schedulings even unfair ones. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a selfstabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The algorithm can deal with any kind of schedulings even unfair ones.
Crossover Composition
 IN PROCEEDINGS OF THE FIFTH WORKSHOP ON SELFSTABILIZING SYSTEMS (WSS 2001
, 2001
"... We study a special type of selfstabilizing algorithms composition: the crossover composition { ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We study a special type of selfstabilizing algorithms composition: the crossover composition {
Service Time of SelfStabilizing Token Circulation Protocol on Anonymous Unidirectional Rings (Extended Abstract)
"... LRI/UMR 8623 CNRS, Universite ParisSud Batiment 490, F91405 Orsay Cedex colette@lri.fr, www.lri.fr/colette/ We present a selfstabilizing token circulation protocol on unidirectional anonymous rings. The ring size is known by the processors. This protocol does not require processor identifiers, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
LRI/UMR 8623 CNRS, Universite ParisSud Batiment 490, F91405 Orsay Cedex colette@lri.fr, www.lri.fr/colette/ We present a selfstabilizing token circulation protocol on unidirectional anonymous rings. The ring size is known by the processors. This protocol does not require processor identifiers, nor distinguished processor (i.e. all processors perform the same code).
Analyze of Randomized SelfStabilizing Algorithms Under NonDeterministic Scheduler Classes
"... model. A non deterministic distributed system is represented in the abstract model of transition systems. A distributed system is a tuple DS = (C; T ; I) where C is the set of all system configurations; T is a transition function of C to the set of C subsets; and I is a subset of the configuration s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
model. A non deterministic distributed system is represented in the abstract model of transition systems. A distributed system is a tuple DS = (C; T ; I) where C is the set of all system configurations; T is a transition function of C to the set of C subsets; and I is a subset of the configuration set called the initial configurations. In a randomized distributed system, there is a probabilistic law on the output of a transition. A computation step is a pair of configurations (c i ; c j ) where c j is an output of a transition starting to c i . A computation e of DS is a sequence of consecutive computation steps e = (c 0 ; c 1 ); (c 1 ; c 2 ) : : :. where c 0 2 I.
Leader Election in Anonymous Rings: Franklin Goes Probabilistic
"... Abstract. We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an algorithm from Franklin [22], augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo 2. As a result, the algorithm i ..."
Abstract
 Add to MetaCart
Abstract. We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an algorithm from Franklin [22], augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo 2. As a result, the algorithm is finitestate, so that various model checking techniques can be employed to verify its correctness, that is, eventually a unique leader is elected with probability one. We also sketch a formal correctness proof of the algorithm for rings with arbitrary size. 1