An extended binary tree quorum strategy for K-mutual exclusion in distributed systems

In this paper, we propose two strategies called generalized binary tree quorum and 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 [1g/sub 2/ n/k] in the best case and is [n+k/2k] 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[1g/sub 2/ n/k]) nodes failures in the best case and k([1g/sub 2/ n/k]) node failures in the worst case. 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.