Snap-Stabilization in Message-Passing Systems

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach, snap-stabilization guarantees that the effect of faults is contained immediately after faults cease to occur. Our contribution is twofold: we show that (1) snap-stabilization is impossible for a wide class of problems if we consider networks with finite yet unbounded channel capacity; (2) snap-stabilization becomes possible in the same setting if we assume bounded-capacity channels. We propose three snap-stabilizing protocols working in fully-connected networks. Our work opens exciting new research perspectives, as it enables the snap-stabilizing paradigm to be implemented in actual networks

Self-stabilizing minimum-degree spanning tree within one from the optimal degree

International audienceWe propose a self-stabilizing algorithm for constructing a Minimum-Degree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most ∆∗ + 1, where ∆∗ is the minimum possible maximum degree of a spanning tree of the network. To the best of our knowledge our algorithm is the first self stabilizing solution for the construction of a minimum-degree spanning tree in undirected graphs. The algorithm uses only local communications (nodes interact only with the neighbors at one hop distance). Moreover, the algorithm is designed to work in any asynchronous message passing network with reliable FIFO channels. Additionally, we use a fine grained atomicity model (i.e. the send/receive atomicity). The time complexity of our solution is O(mn2 log n) where m is the number of edges and n is the number of nodes. The memory complexity is O(δ log n) in the send-receive atomicity model (δ is the maximal degree of the network)

Synchronization Algorithms on Oriented Chains

We present a space- and time-optimal self-stabilizing algorithm, SSDS, for a given synchronization problem on asynchronous oriented chains. SSDS is uniform and works under the unfair distributed daemon. From SSDS we derive solutions for the local mutual exclusion and distributed sorting. Algorithm SSDS can also be used to obtain optimal space solutions for other problems such as broadcasting, leader election, and mutual exclusion

On the Limits and Practice of Automatically Designing Self-Stabilization

A protocol is said to be self-stabilizing when the distributed system executing it is guaranteed to recover from any fault that does not cause permanent damage. Designing such protocols is hard since they must recover from all possible states, therefore we investigate how feasible it is to synthesize them automatically. We show that synthesizing stabilization on a fixed topology is NP-complete in the number of system states. When a solution is found, we further show that verifying its correctness on a general topology (with any number of processes) is undecidable, even for very simple unidirectional rings. Despite these negative results, we develop an algorithm to synthesize a self-stabilizing protocol given its desired topology, legitimate states, and behavior. By analogy to shadow puppetry, where a puppeteer may design a complex puppet to cast a desired shadow, a protocol may need to be designed in a complex way that does not even resemble its specification. Our shadow/puppet synthesis algorithm addresses this concern and, using a complete backtracking search, has automatically designed 4 new self-stabilizing protocols with minimal process space requirements: 2-state maximal matching on bidirectional rings, 5-state token passing on unidirectional rings, 3-state token passing on bidirectional chains, and 4-state orientation on daisy chains

Files as first-class objects in fault -tolerant concurrent systems

Concurrent systems are used in applications where multiple processors are needed to complete tasks within a reasonable amount of time, or where the data sets involved will not fit within the main memory of a single computer. Because of their reliance on multiple machines, such systems are proportionally more vulnerable to both hardware and software induced failures. Fault-tolerance schemes are used to recover some earlier consistent state of the system after such a failure.;One important technique used to achieve fault-tolerance is checkpointing and rollback-recovery. In this thesis, we present a method for efficiently and transparently incorporating the part of the process state contained in the file system into process checkpoints, and we show how recovery of consistent versions of the file system and processes may be done after a failure. We present the details of a prototype system which implements our method.;We show that by using the special properties of the log-structured file system, the class of programs which are amenable to checkpointing and rollback-recovery schemes can be expanded to include those that use files. We impose no a priori restriction on the types of file system operations that can be done, and we demonstrate that our scheme does not impose significant failure-free overhead on the computation

Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model

International audienceStarting from any configuration, a snap-stabilizing protocol guarantees that the system always behaves according to its specification while a self-stabilizing protocol only guarantees that the system will behave according to its specification in a finite time. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). That property is very suitable in the case of systems that are prone to transient faults. There exist a lot of approaches of the concept of self-stabilization, but to our knowledge, snap-stabilization is the only variant of self-stabilization which has been proved power equivalent to self-stabilization in the context of the state model (a locally shared memory model) and for non anonymous systems. So the problem of the existence of snap-stabilizing solutions in the message passing model is a very crucial question from a practical point of view. In this paper, we present the first snap-stabilizing propagation of information with feedback (PIF) protocol for non-oriented trees in the message passing model. Moreover using slow and fast timers, the round complexity of our algorithm is in θ(h ×k) and θ((h ×k) + k 2), respectively, where h is the height of the tree and k is the maximal capacity of the channels. We conjecture that our algorithm is optimal

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets

A novel musculoskeletal joint modelling for orthopaedic applications

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.The objective of the work carried out in this thesis was to develop analytical and computational tools to model and investigate musculoskeletal human joints. It was recognised that the FEA was used by many researchers in modelling human musculoskeletal motion, loading and stresses. However the continuum mechanics played only a minor role in determining the articular joint motion, and its value was questionable. This is firstly due to the computational cost and secondly due to its impracticality for this application. On the other hand, there isn’t any suitable software for precise articular joint motion analysis to deal with the local joint stresses or non standard joints. The main requirement in orthopaedics field is to develop a modeller software (and its associated theories) to model anatomic joint as it is, without any simplification with respect to joint surface morphology and material properties of surrounding tissues. So that the proposed modeller can be used for evaluating and diagnosing different joint abnormalities but furthermore form the basis for performing implant insertion and analysis of the artificial joints. The work which is presented in this thesis is a new frame work and has been developed for human anatomic joint analysis which describes the joint in terms of its surface geometry and surrounding musculoskeletal tissues. In achieving such a framework several contributions were made to the 6DOF linear and nonlinear joint modelling, the mathematical definition of joint stiffness, tissue path finding and wrapping and the contact with collision analysis. In 6DOF linear joint modelling, the contribution is the development of joint stiffness and damping matrices. This modelling approach is suitable for the linear range of tissue stiffness and damping properties. This is the first of its kind and it gives a firm analytical basis for investigating joints with surrounding tissue and the cartilage. The 6DOF nonlinear joint modelling is a new scheme which is described for modelling the motion of multi bodies joined by non-linear stiffness and contact elements. The proposed method requires no matrix assembly for the stiffness and damping elements or mass elements. The novelty in the nonlinear modelling, relates to the overall algorithmic approach and handling local non-linearity by procedural means. The mathematical definition of joint stiffness is also a new proposal which is based on the mathematical definition of stiffness between two bodies. Based on the joint stiffness matrix properties, number of joint stiffness invariants was obtained analytically such as the centre of stiffness, the principal translational stiffnesses, and the principal rotational stiffnesses. In corresponding to these principal stiffnesses, their principal axes have been also obtained. Altogether, a joint is assessed by six principal axes and six principal stiffnesses and its centre of stiffness. These formulations are new and show that a joint can be described in terms of inherent stiffness properties. It is expected that these will be better in characterising a joint in comparison to laxity based characterisation. The development of tissue path finding and wrapping algorithms are also introduced as new approaches. The musculoskeletal tissue wrapping involves calculating the shortest distance between two points on a meshed surface. A new heuristic algorithm was proposed. The heuristic is based on minimising the accumulative divergence from the straight line between two points on the surface and the direction of travel on the surface (i.e. bone). In contact and collision based development, the novel algorithm has been proposed that detects possible colliding points on the motion trajectory by redefining the distance as a two dimensional measure along the velocity approach vector and perpendicular to this vector. The perpendicular distance determines if there are potentially colliding points, and the distance along the velocity determines how close they are. The closest pair among the potentially colliding points gives the “time to collision”. The algorithm can eliminate the “fly pass” situation where very close points may not collide because of the direction of their relative velocity. All these developed algorithms and modelling theories, have been encompassed in the developed prototype software in order to simulate the anatomic joint articulations through modelling formulations developed. The software platform provides a capability for analysing joints as 6DOF joints based on anatomic joint surfaces. The software is highly interactive and driven by well structured database, designed to be highly flexible for the future developments. Particularly, two case studies are carried out in this thesis in order to generate results relating to all the proposed elements of the study. The results obtained from the case studies show good agreement with previously published results or model based results obtained from Lifemod software, whenever comparison was possible. In some cases the comparison was not possible because there were no equivalent results; the results were supported by other indicators. The modelling based results were also supported by experiments performed in the Brunel Orthopaedic Research and Learning Centre