Performance Analysis of Proxy-Based Object-Oriented Distributed Systems Using Game Theory

Recently, there has been a remarkable growth of research on the practical applications of game theory in networks, and in particular, the modeling of users’ behavior in distributed and decentralized systems. Reducing the runtime of operations in these types of systems will increase their performance. In order to achieve this goal, the system can be implemented using an object-oriented approach, through which the client machine treats the srver machine as an object, and the communication between them is done only through a proxy. In these types of systems, users have a set of possible choices, and may choose personal benefits over the interest of the whole system and other users. Since in a distributed system, all users want to control their resource of choice, the use of game theory can be a good tool to evaluate the behavior of selfish nodes. In this paper, game theory is used to investigate the behavior of nodes in an object-oriented distributed system, in which the communication between the client machine and the server machine is established through a proxy. To understand the behavior of nodes in a distributed system,one-time games and infinitely-repeated games are studied, and finally, the behavior of one node against an object-oriented distribution system is analyzed. According to the results of this study, nodes defect and will be uncooperative in one-time games. But when there is a strategy of an infinitely-repeated game, the cooperation between nodes will depend on the discount factor, or the probability of the next stage.