A new resource sharing protocol in the light of token-based strategy for distributed system

One of the highly researched areas in distributed system is mutual exclusion. To avoid any inconsistent state of system, more than one processes executing on different processors are not allowed to invoke their critical sections simultaneously for the purpose of resource sharing. As a solution to such resource allocation issues, token-based strategy for distributed mutual exclusion algorithms as a prime classification of solutions is one of the most popular and significant ways to handle mutual exclusion in this field. Through this research article, we propose a novel token-based distributed mutual exclusion algorithm. The proposed solution is scalable and has better results in terms of message complexity compared to existing solutions. In this proposed art of work, the numbers of messages exchange per critical section invocation are 3(⌈log N⌉ - 1), 3⌈(⌈log (N + 1) ⌉ - 1)/2⌉ and 6[⌈log (N + 1)⌉ + 2(2(-⌈log (N+1)⌉) - 1)] in case of light load, medium load and high load situations respectively.