International audienceThis paper presents an efficient and fair fault-tolerant token-based algorithm for achieving mutual exclusion. It is an extension of the Naimi-Trehel algorithm that uses a distributed queue of token requests and a dynamic tree. In case of failures, our algorithm tries to recover the requests' queue by gathering intact portions of the one which existed just before the failure. Thus, fairness of token requests is preserved despite failures. Furthermore, the use of broad- cast is minimized when rebuilding the dynamic tree. Experiment results with different fault injection scenar- ios show that our approach presents a fast failure recovery and low message broadcast overhead
This paper presents a token-based K-mutual exch-sion algorithm. The algorithm uses K tokens and a dy...
A distributed mutual exclusion algorithm based on to-ken exchange and well suited for mobile ad-hoc ...
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per ...
International audienceThis article presents a fault tolerant extension for the Naimi-Trehel token-ba...
A token based algorithm for distributed mutual exclusion is presented. It uses a distributed counter...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the presen...
This paper is a contribution to the inception of multiple tokens in solving distributed mutual exclu...
This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tol...
In this paper, we present a decentralized token generation scheme for token-based mutual exclusion a...
International audienceWe present in this paper a fault tolerant permission-based k-mutual exclusion ...
A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree s...
This paper aims towards designing a new token-based mutual exclusion algorithm for distributed syste...
This paper proposes a fault tolerant permission-based k-mutual exclusion algorithm which does not re...
This paper presents a token-based K-mutual exch-sion algorithm. The algorithm uses K tokens and a dy...
A distributed mutual exclusion algorithm based on to-ken exchange and well suited for mobile ad-hoc ...
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per ...
International audienceThis article presents a fault tolerant extension for the Naimi-Trehel token-ba...
A token based algorithm for distributed mutual exclusion is presented. It uses a distributed counter...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
Eliminating interference between concurrently executing activities through mutual exclusion is one o...
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the presen...
This paper is a contribution to the inception of multiple tokens in solving distributed mutual exclu...
This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tol...
In this paper, we present a decentralized token generation scheme for token-based mutual exclusion a...
International audienceWe present in this paper a fault tolerant permission-based k-mutual exclusion ...
A new distributed mutual exclusion algorithm, using a token and based upon an original rooted tree s...
This paper aims towards designing a new token-based mutual exclusion algorithm for distributed syste...
This paper proposes a fault tolerant permission-based k-mutual exclusion algorithm which does not re...
This paper presents a token-based K-mutual exch-sion algorithm. The algorithm uses K tokens and a dy...
A distributed mutual exclusion algorithm based on to-ken exchange and well suited for mobile ad-hoc ...
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per ...