Results 1  10
of
98
Uniform dynamic selfstabilizing leader election
 IEEE Transactions on Parallel and Distributed Systems
, 1997
"... Abstract—A distributed system is selfstabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The selfstabilization property makes the system tolerant to faults in which processors exhibit a ..."
Abstract

Cited by 113 (10 self)
 Add to MetaCart
(Show Context)
Abstract—A distributed system is selfstabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The selfstabilization property makes the system tolerant to faults in which processors exhibit a faulty behavior for a while and then recover spontaneously in an arbitrary state. When the intermediate period in between one recovery and the next faulty period is long enough, the system stabilizes. A distributed system is uniform if all processors with the same number of neighbors are identical. A distributed system is dynamic if it can tolerate addition or deletion of processors and links without reinitialization. In this work, we study uniform dynamic selfstabilizing protocols for leader election under readwrite atomicity. Our protocols use randomization to break symmetry. The leader election protocol stabilizes in OaD'log nf time when the number of the processors is unknown and OaD'f, otherwise. Here D denotes the maximal degree of a node, ' denotes the diameter of the graph and n denotes the number of processors in the graph. We introduce selfstabilizing protocols for synchronization that are used as building blocks by the leaderelection algorithm. We conclude this work by presenting a simple, uniform, selfstabilizing ranking protocol. Index Terms—Selfstabilizing systems, leader election, distributed algorithms, randomized distributed algorithms, synchronization. 1
Computing on anonymous networks, part I: characterizing the solvable cases
 IEEE TRANSACTION ON PARALLEL AND DISTRIBUTED COMPUTING
, 1996
"... In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a g ..."
Abstract

Cited by 81 (3 self)
 Add to MetaCart
(Show Context)
In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be solvable, depending on the amount of information about the attributes of the network made available to the processors. Some possibilities are: (1) no network attribute information at all is available, (2) an upper bound on the number of processors in the network is available, (3) the exact number of processors in the network is available, and (4) the topology of the network is available. In terms of a new graph property called “symmetricity, ” in each of the four cases (1)–(4) above, we characterize the class of networks on which each of the four problems (a)–(d) is solvable. We then relate the symmetricity of a network to its 1 and 2factors.
Electing a Leader in a Synchronous Ring
, 1987
"... The problem of electing a leader in a synchronous ring of n processon is considered. Both positive and negative results are obtained. On the one hand, if processor IDs are chosen from some countable set, then there is an algorithm that uses only O(n) messages in the wont case. On the other hand, any ..."
Abstract

Cited by 56 (2 self)
 Add to MetaCart
The problem of electing a leader in a synchronous ring of n processon is considered. Both positive and negative results are obtained. On the one hand, if processor IDs are chosen from some countable set, then there is an algorithm that uses only O(n) messages in the wont case. On the other hand, any algorithm that is restricted to use only comparisons of IDs requires fl(n log n) messages in the worst case. Alternatively, if the number of rounds is required to be bounded by some t in the wont case, and lDs are chosen from any set having at least f(n, t) elements, for a certain very fastgrowing functionf then any algorithm requires fl(n log n) messages in the wont case.
Hundreds of Impossibility Results for Distributed Computing
 Distributed Computing
, 2003
"... We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, faulttolerance, different communication media, and randomization. The resource bounds refe ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, faulttolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed computing.
Survey of local algorithms
, 2009
"... Abstract. A local algorithm is a distributed algorithm that runs in a constant number of synchronous communication rounds, regardless of the size of the network. Hence the output of a node in the network is a function of the input available within its constantradius neighbourhood. Local algorithms ..."
Abstract

Cited by 40 (12 self)
 Add to MetaCart
(Show Context)
Abstract. A local algorithm is a distributed algorithm that runs in a constant number of synchronous communication rounds, regardless of the size of the network. Hence the output of a node in the network is a function of the input available within its constantradius neighbourhood. Local algorithms are not only highly scalable but also robust to changes in the network. Moreover, local algorithms can be used as subroutines in the design of centralised algorithms. This work is a survey of local algorithms. We review impossibility results, deterministic local algorithms, randomised local algorithms, and local algorithms for geometric problems.
Sense of Direction: Definitions, Properties and Classes
"... An extensive body of evidence exists of the impact that specific edge labelings have on the communication complexity of distributed problems. It has been long suspected that these very different labelings share a common property, named Sense of Direction. In spite of the large amount of investigati ..."
Abstract

Cited by 36 (10 self)
 Add to MetaCart
An extensive body of evidence exists of the impact that specific edge labelings have on the communication complexity of distributed problems. It has been long suspected that these very different labelings share a common property, named Sense of Direction. In spite of the large amount of investigations, and of the obvious practical importance, a formal characterization of this property did not exist. In this paper, we finally provide a formal definition of sense of direction, making explicit the very specific relationship between three factors: the labeling, the topological structure, and the local view that an entity has of the system. In a way, sense of direction is the capability of a node in the system to use the labeling to translate the local view of its neighbors into its own. Using the formal definition as an observational platform, we describe several properties which allow the translation process to be possible beyond the immediate neighborhood. Finally, we identify four gene...
An Effective Characterization of Computability in Anonymous Networks
 In Distributed Computing, 15th International Symposium
"... We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, inte ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).
Computing Anonymously with Arbitrary Knowledge
 In Proceedings of the 18th ACM Symposium on principles of distributed computing
, 1999
"... We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (in particular, we do not assume that a bound on the network size is known). Three activation models are considered (synch ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
(Show Context)
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (in particular, we do not assume that a bound on the network size is known). Three activation models are considered (synchronous, asynchronous, interleaved) . 1 Introduction The question concerning which problems can be solved by a distributed system when all processors use the same algorithm and start from the same state has a long story: it was firstly formulated by Angluin [1], who investigated the problem of establishing a "center". She was the first to realize the connection with the theory of graph coverings, which was going to provide, in particular with the work of Yamashita and Kameda [11], several characterization for problems that are solvable under certain topological constraints. Further investigation led to the classification of computable functions [11, 10, 3, 9], and allowed to eliminate severa...
Sense of Direction in Distributed Computing
 In 12th International Symposium on Distributed Computing (DISC
, 1998
"... Sense of Direction is a property of labeled graphs which has been shown to have a definite impact on computability and complexity in systems of communicating entities, and whose applicability ranges from the analysis of graph classes to distributed object systems. The full consequences of this pr ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
(Show Context)
Sense of Direction is a property of labeled graphs which has been shown to have a definite impact on computability and complexity in systems of communicating entities, and whose applicability ranges from the analysis of graph classes to distributed object systems. The full consequences of this property are still not known; in fact, the ongoing investigations continue to bring new (often surprising) results, to establish unsuspected links with other research and/or application areas, and to pose more questions than they answer. The aim of this paper is to provide a view of the current status of research, describing some of the relevant results, and providing pointers to future research directions. 1 Introduction In its more general formulation, a distributed system is a collection of computational entities communicating by exchanging finite amounts of information, which we shall call messages. The exact nature of the entities (i.e., processors, processes, network nodes, agents,...