A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
| Hi-index | 0.00 |
In this paper, we propose two strategies called {\it generalized binary tree quorum} and {\it extended binary tree quorum} for k-mutual exclusion, which impose a logical structure on the network. Both of the proposed strategies are based on a logical binary tree structure. The quorum size constructed from both strategies is \lceil \lg_{2}\frac{n}{k} \rceil in the best case and is \lceil \frac{n+k}{2k} \rceil in the worst case, where n is the number of nodes in the system. Moreover, both strategies can be fault-tolerant up to (n-k\lceil \lg_{2} \frac{n}{k} \rceil) node failures in the best case and k (\lceil \lg_{2}\frac{n}{k} \rceil -1) node failures in the worst case. From our performance analysis, we show that the extended binary tree quorum strategy can provide a higher availability than k-majority, cohorts, and DIV strategies almost all the time. Moreover, the quorum size of the extended binary tree quorum is always the smallest one among these four strategies, when n 12. While in the worst case, the quorum size of the extended binary tree quorum is always smaller than that of 4-majority and DIV strategies.