Mehmet Hakan Karaata

Self-stabilizing strong fairness under weak fairness

Fairness assumptions have a great impact on distributed algorithms. They play a major role in determining the time complexity and the correctness of algorithms, since progress or freedom from various types of starvation may not be guaranteed without fairness assumptions. In this paper, we present a stabilizing deterministic algorithm allowing simultaneous execution of actions for strong fairness under weak fairness assumption, in addition, we show that the proposed algorithm yields a high degree of concurrency. We conclude the paper with some remarks on issues such as time optimal implementation of strong fairness and open problems related to fairness.

A self-stabilizing algorithm for bridge finding

Summary. A self-stabilizing algorithm is presented in this paper that finds the bridges of a connected undirected graph on a distributed or network model of computation after

An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks

O(\vert E\vert n^2)

A Stabilizing Algorithm for Finding Biconnected Components

moves. The algorithm is resilient to transient faults and does not require initialization. In addition, a correctness proof of the algorithm is provided. The paper concludes with remarks on the time complexity of the algorithm.

A self-stabilizing algorithm for strong fairness

The node-disjoint paths problem deals with finding node-disjoint paths from a source node s to target node t, where t ¿ s. Two paths from s to t are said to be node-disjoint iff they do not have any common vertices except for their endpoints. Distributed solutions to the node-disjoint paths problem have numerous applications such as secure message transmission, reliable routing, and network survivability. In this paper, we present a simple distributed algorithm that is both stabilizing and inherently stabilizing under a realistic model that describes system interfaces and implementation issues in detail to route messages over all shortest node-disjoint paths from one process to another in an n-dimensional hypercube network.

An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks

In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based on stabilizing BFS construction and bridge-finding algorithms. Upon termination of these algorithms, the proposed algorithm terminates after O (d) rounds, where d is the diameter of the biconnected component with the largest diameter in the graph. The paper concludes with remarks on issues such as the adaptiveness of the algorithm.

Brief announcement: a stabilizing algorithm for finding two edge-disjoint paths in arbitrary graphs

Self-stabilization is a novel technique to deal with faults in distributed systems. This paper presents a distributed self-stabilizing algorithm for implementing strong fairness in an arbitrary network. A desirable feature of this algorithm is that it can be used to enforce the strong fairness property on any distributed algorithm including self-stabilizing algorithms. In addition, the algorithm does not require any initialization and can withstand transient failures. At the end of the paper such issues as improving the time complexity of the proposed algorithm and the limitations on the efficiency of any implementation of strong fairness are discussed.

A dynamic self-stabilizing algorithm for constructing a transport net

In this paper, we present an adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks. Given two distinct nodes s and t of a network, the all disjoint paths problem is to identify all disjoint paths from s to t. Since our algorithm is stabilizing, it does not require initialization and withstands transient faults. In addition, the proposed algorithm adapts to topology changes in the form of process/link crashes and additions, i.e., upon a topology change, it finds all available paths from s to t. The space complexity of our algorithm is 4xd states for the source process s, one state for the target process, 120xd states for other processes, where d is the diameter of the communication network. The time complexity of the proposed algorithm is O(d) rounds. The proposed algorithm has a wide range of applications in ensuring reliability and security of sensor, mobile and fixed communication networks.

Imposter Detection in Mobile Wireless Sensor Networks

Given two distinct nodes s and t of a directed graph G = (V,E), where V is the set of nodes and E is the set of arcs, the problem of identifying two edge-disjoint paths from s to t is to identify two distinct paths Q 1 and Q 2 from s to t such that Q 1 and Q 2 share no common arc.

A dynamic self-stabilizing algorithm for finding strongly connected components

transport net corresponding to an undirected biconnected graph on a distributed or network model of computation. The algorithm is resilient to transient faults and does not require initialization. In addition, it is capable of handling topology changes in a transient manner. The paper includes a correctness proof of the algorithm. Finally, it concludes with some final remarks.