| Abstract: | In this paper, we propose a token-based distributed mutual exclusion algorithm that is resilient to site and communication failures. The protocol uses the notion of logical time to detect the loss of the token and to recover the state of the lost token. Unlike other approaches, this results in the integration of token recovery due to failures with the protocol itself. Thus, we eliminate the need for expensive election protocols that are generally used in token-based algorithms to regenerate lost tokens. We also introduce the notion of weakly consistent replicated queues that are used to ensure freedom from starvation. |
