Please use this identifier to cite or link to this item:
|Title:||A TOKEN BASED K-RESILIENT MUTUAL EXCLUSION ALGORITHM FOR DISTRIBUTED SYSTEMS|
|Publisher:||ELSEVIER SCIENCE BV|
|Citation:||INFORMATION PROCESSING LETTERS, 50(3), 151-157|
|Abstract:||This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate up to k site/link failures. The algorithm uses many features of the token based algorithm by Raymond and inherits many of its advantages, viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.