The tree quorum algorithm (TQA), which logically organizes thensites in a system into a tree, is an efficient and fault-tolerantnsolution for distributed mutual exclusion. Quorum size can be reduced tonlog N in the best case of TQA. In this paper, message complexity of TQAnis analyzed. Moreover, it is shown that the ratio of message complexitynto quorum size converges to 1/p, where p is the probability that a sitenis operational
展开▼
