Developing End-to-End mutual exclusion protocol in Peer-to-Peer systems

Mutual exclusion is an important problem for concurrent full access to shared resources in peer-to-peer systems. Despite the mutual exclusion is one of the well studied fundamental primitives in distributed systems, the peer-to-peer (P2P) systems bring forward several challenges that canpsilat be completely solved by previous approaches. So, there is a need to find efficient ways of concurrent access to shared resource. In this paper, we develop End-To-End protocol, one of the existing protocols that are implemented atop dynamic Peer-To-Peer systems for distributed hash-table in order to satisfy fairness, decentralizing, and reduce the message overhead. The basic idea is to build a group of all requesting nodes and replicas of specific resource and at all members maintain and save the request queue, instead of using the first n waiting requesters, in which the elements communicate with each other by exchanging multicast messages to reduce the message overhead. We analytically prove the correctness of our algorithm, and evaluate its scalability and efficiently experimentally using simulations. The results of experiments were compared with existing DME protocols. The developed protocol presents a competitive level of performance and achieves the requirements of DME for providing efficient and reliable access to shared resources.