A solution to improve algorithm for distributed mutual exclusion by restricting message exchange in quorums

In this paper, we have proposed a permission based distributed mutual exclusion algorithm which is an improvement of Maekawa's algorithm. The number of messages required by the improvised algorithm is in the range 3M to 5M per critical section invocation where M is the number of intersection nodes1 in the system. A reduction in number of message by restricting the communication of any node with the intersection nodes of the quorums, without any modification of the basic structure of the algorithm.