Results 1  10
of
12
Conflict Managers for Selfstabilization without Fairness Assumption
"... In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is st ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is strictly weaker than the classical local mutual exclusion problem, where any node that requests to enter its critical section eventually does so (fairness). We argue that conflict managers are a useful mechanism to transform a large class of selfstabilizing algorithms that operate in an essentially sequential model, into selfstabilizing algorithm that operate in a completely asynchronous distributed model. We provide two implementations (one deterministic and one probabilistic) of our abstraction, and provide a composition mechanism to obtain a generic transformer. Our transformers have low overhead: the deterministic transformer requires one memory bit, and guarantees time overhead in order of the network degree, the probabilistic transformer does not require extra memory. While the probabilistic algorithm performs in anonymous networks, it only provides probabilistic stabilization guarantees. In contrast, the deterministic transformer requires initial symmetry breaking but preserves the original algorithm guarantees.
Selfstabilizing Algorithms for Graph Coloring With Improved Performance Guarantees
, 2006
"... In the selfstabilizing model we consider a connected system of autonomous asynchronous nodes, each of which has only local information about the system. Regardless of the initial state, the system must achieve a desirable global state by executing a set of rules assigned to each node. The paper ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In the selfstabilizing model we consider a connected system of autonomous asynchronous nodes, each of which has only local information about the system. Regardless of the initial state, the system must achieve a desirable global state by executing a set of rules assigned to each node. The paper deals with the construction of a solution to graph coloring in this model, a problem motivated by code assignment in wireless networks. A new
An advanced performance analysis of selfstabilizing protocols: stabilization time with transient faults during convergence
 In 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2529 April, Rhodes Island
, 2006
"... A selfstabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended behavior. Performance of a selfstabilizing protocol is usually measured by stabilization time: the time required to compl ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
A selfstabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended behavior. Performance of a selfstabilizing protocol is usually measured by stabilization time: the time required to complete the convergence to its intended behavior under the assumption that no new fault occurs during the convergence. But a selfstabilizing protocol has no guarantee to complete the convergence if faults are frequently occurred. This paper brings new light to efficiency analysis of stabilization. The efficiency is evaluated with consideration for faults occurring during the convergence. To show the feasibility and effectiveness of the approach, this paper applies the approach to the maximal matching protocol. 1
An Efficient Selfstabilizing Distance2 Coloring Algorithm
"... Abstract. We present a selfstabilizing algorithm for the distance2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δ 2 m)movesusingatmostΔ 2 + 1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph. The analysi ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present a selfstabilizing algorithm for the distance2 coloring problem that uses a constant number of variables on each node and that stabilizes in O(Δ 2 m)movesusingatmostΔ 2 + 1 colors, where Δ is the maximum degree in the graph and m is the number of edges in the graph. The analysis holds true both for the sequential and the distributed adversarial daemon model. This should be compared with the previous best selfstabilizing algorithm for this problem which stabilizes in O(nm) moves under the sequential adversarial daemon and in O(n 3 m) time steps for the distributed adversarial daemon and which uses O(δi) variables on each node i, whereδi is the degree of node i. 1
A FaultContaining SelfStabilizing Algorithm for 6Coloring Planar Graphs
"... This paper presents the first faultcontaining selfstabilizing algorithm which can 6color any planar graph. Besides the capability to contain the fault in any singlefault situation, the proposed algorithm also has the capability to stabilize faster in singlefault situations. For singlefault sit ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
This paper presents the first faultcontaining selfstabilizing algorithm which can 6color any planar graph. Besides the capability to contain the fault in any singlefault situation, the proposed algorithm also has the capability to stabilize faster in singlefault situations. For singlefault situations, the worstcase stabilization time of the proposed algorithm is O(Δ), whereas the worstcase stabilization times of all the previous selfstabilizing algorithms for 6coloring planar graphs are Ω(n), where Δ is the maximum node degree, and n is the number of nodes in the system.
An Advanced Performance Analysis of Selfstabilizing Protocols: Stabilization Time with Transient Faults during Convergence
, 2006
"... An advanced performance analysis of selfstabilizing protocols: Stabilization time with transient faults during convergence ..."
Abstract
 Add to MetaCart
(Show Context)
An advanced performance analysis of selfstabilizing protocols: Stabilization time with transient faults during convergence
Time and SpaceEfficient SelfStabilizing Algorithms
, 2012
"... In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Selfstabilization is a general approach to ..."
Abstract
 Add to MetaCart
In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Selfstabilization is a general approach to make a distributed system tolerate arbitrary transient faults by design. A selfstabilizing algorithm reaches a legitimate configuration in a finite number of steps by itself without any external intervention, regardless of the initial configuration. Furthermore, once having reached legitimacy this property is preserved. An important characteristic of an algorithm is its worstcase runtime and its memory requirements. This thesis presents new time and spaceefficient selfstabilizing algorithms for wellknown problems in algorithmic graph theory and provides new complexity analyses for existing algorithms. The main focus is on proof techniques used in the complexity analyses and the design of the algorithms. All algorithms presented in this thesis assume the most general concept with respect to concurrency.
Conflict Managers for Selfstabilization without Fairness Assumption
"... In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is st ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is strictly weaker than the classical local mutual exclusion problem, where any node that requests to enter its critical section eventually does so (fairness). We argue that conflict managers are a useful mechanism to transform a large class of selfstabilizing algorithms that operate in an essentially sequential model, into selfstabilizing algorithm that operate in a completely asynchronous distributed model. We provide two implementations (one deterministic and one probabilistic) of our abstraction, and provide a composition mechanism to obtain a generic transformer. Our transformers have low overhead: the deterministic transformer requires one memory bit, and guarantees time overhead in order of the network degree, the probabilistic transformer does not require extra memory. While the probabilistic algorithm performs in anonymous networks, it only provides probabilistic stabilization guarantees. In contrast, the deterministic transformer
Selfstabilizing Cuts in Synchronous Networks
, 2008
"... Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the network graph. In each r ..."
Abstract
 Add to MetaCart
(Show Context)
Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called selfstabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the network graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all unsatisfied nodes change sides independently with a fixed probability p. Using different notions of satisfaction enables the computation of maximal and minimal cuts, respectively. We analyze the expected time until such cuts are reached on several graph classes and consider the impact of the parameter p and the initial cut.