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

In this paper, we propose two strategies called degree-k-tree quorum and extended degree-k-tree quorum for k-mutual exclusion, which impose a logical degree-k-tree structure on the network. From our performance analysis, we show that the extended degree-k-tree quorum strategy can provide a higher availability than k-majority, cohorts, and DIV strategies, sometimes. Moreover, the quorum size of the extended degree-k-tree quorum strategy is always the smallest one among these four strategies, when n>12