A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm

D. Agrawal, A. Elabbadi

Research output: Contribution to journalArticle

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)164-176
Number of pages13
JournalJournal of Parallel and Distributed Computing
Issue number2
Publication statusPublished - 1 Feb 1995
Externally publishedYes


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this