Most of distributed mutual exclusion algorithms do not use the notion of priority. To solve the distributed prioritized mutual exclusion problem, F. Mueller[9] has already prioritized a token and tree based algorithm. The goal of this paper is to show the introduction of priority in an other token-based algorithm. This work can be considered an improvement of F.

In this paper, we present a new algorithm for distributed mutual exclusion that combines the advantages of existing centralized and token-based algorithms: it takes only two messages to acquire the lock when it is not held by another process, and only one message to pass the lock from one process to another. At the same time, our algorithm generates signiicantly less message traac than non-cent...

This article presents a fault tolerant extension for the NaimiTrehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in w...

Voice communication is an emerging technology and has great importance in our routine life. Perceptual, Voice over Internet Protocol quality is an important issue for VoIP Apps services because VoIP Apps require real-time support. Many network factors (packet loss, packet delay, and jitter) affect to VoIP quality, to achieve this objective we used an approach based on Fuzzy Logic. We configure ...

In this paper, a new hybrid algorithm which combines both of token-based and character-based approaches is presented. The basic Levenshtein approach has been extended to token-based distance metric. The distance metric is enhanced to set the proper granularity level behavior of the algorithm. It smoothly maps a threshold of misspellings differences at the character level, and the importance of ...

We present a simple implementation of a token-based distributed mutual exclusion algorithm for multithreaded systems. Several per-node requests could be issued by threads running at each node. Our algorithm relies on special-purpose alien threads running at host processors on behalf of threads running at other processors. The algorithm uses a tree to route requests for the token. We present a p...

We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease th...