Results 1  10
of
865
Selfstabilizing Algorithms
, 2011
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
FaultContaining SelfStabilizing Algorithms
 In PODC96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing
, 1996
"... . Selfstabilization provides a nonmasking approach to fault tolerance. Given this fact, one would hope that in a selfstabilizing system, the amount of disruption caused by a fault is proportional to the severity of the fault. However, this is not true for many selfstabilizing systems. Our paper ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
addresses this weakness of distributed selfstabilizing systems by introducing the notion of fault containment. Informally, a faultcontaining selfstabilizing algorithm is one that contains the effects of limited transient faults while retaining the property of selfstabilization. The paper begins with a
TimeOptimal SelfStabilizing Algorithms for Network Orientation
"... : In this paper we first present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree construction, the connectivity or orientation on certain interconnection networks. These bounds are of the form\Omega (D), ..."
Abstract
 Add to MetaCart
), where D is the diameter of the network. Moreover, timeoptimal selfstabilizing algorithms for computing the orientation on tori, rings, hypercubes, CCC, butterflies, stars and outerplanar graphs are presented. This gives an affirmative answer to the problem 15:4 for tori stated in [Tel 94b]. Key Words
SelfStabilizing Algorithms For Finding Centers And Medians Of Trees
, 1994
"... The problem of locating centers and medians of graphs has a variety of applications in the areas of transportation and communication in distributed systems. This paper presents simple selfstabilizing algorithms for locating centers and medians of trees. Since the algorithms are selfstabilizing the ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
The problem of locating centers and medians of graphs has a variety of applications in the areas of transportation and communication in distributed systems. This paper presents simple selfstabilizing algorithms for locating centers and medians of trees. Since the algorithms are selfstabilizing
Selfstabilizing algorithm for maximal 2packing
 Nordic Journal of Computing
, 2004
"... In the selfstabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a finite amount of time the system converges to a global state, satisfying some desired property. In a graph G = (V, E), a subset S ⊆ V is a 2packing if ∀u ∈ V: N [u] ∩ S  ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In the selfstabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a finite amount of time the system converges to a global state, satisfying some desired property. In a graph G = (V, E), a subset S ⊆ V is a 2packing if ∀u ∈ V: N [u
Selfstabilizing Algorithms for Orderings and Colorings
"... A kforward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called selfstabilizing. We obtain three selfstab ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
A kforward numbering of a graph is a labeling of the nodes with integers such that each node has less than k neighbors whose labels are equal or larger. Distributed algorithms that reach a legitimate state, starting from any illegitimate state, are called selfstabilizing. We obtain three selfstabilizing
TwoState selfStabilizing algorithms
 In Proceedings of the IPPS92
, 1992
"... This paper introduces a novel scheme of improving the performance of particle swarm optimization (PSO) by a vector differential operator borrowed from differential evolution (DE). Performance comparisons of the proposed method are provided against (a) the original DE, (b) the canonical PSO, and (c) ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
) three recent, highperformance PSOvariants. The new algorithm is shown to be statistically significantly better on a sevenfunction test suite for the following performance measures: solution quality, time to find the solution, frequency of finding the solution, and scalability. Categories and Subject
Randomized Selfstabilizing Algorithms for Wireless Sensor Networks
, 2006
"... Wireless sensor networks (WSNs) pose challenges not present in classical distributed systems: resource limitations, high failure rates, and ad hoc deployment. The lossy nature of wireless communication can lead to situations, where nodes lose synchrony and programs reach arbitrary states. Traditiona ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
. Traditional approaches to fault tolerance like replication or global resets are not feasible. In this work, the concept of selfstabilization is applied to WSNs. The majority of selfstabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon
Distancek knowledge in selfstabilizing algorithms
"... Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual selfstabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general transformation for constructing selfstabilizing algo ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
algorithms which utilize distancek knowledge. Our transformation has both a slowdown and space overhead in n O(log k), and might be thought of as a distancek resource allocation algorithm. Our main application is a polynomialtime selfstabilizing algorithm for finding maximal irredundant sets, a problem
Distancek information in selfstabilizing algorithms
 the Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO’06
"... Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual selfstabilizing model only allows for nodes to make decisions based on the states of their immediate neighbors. We provide a general polynomial transformation for constructing se ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
selfstabilizing algorithms which utilize distancek knowledge, with a slowdown of n O(log k). Our main application is a polynomialtime selfstabilizing algorithm for finding maximal irredundant sets, a problem which seems to require distance4 information. We also show how to find maximal k
Results 1  10
of
865