Ayo game approach to mitigate free riding in peer-to-peer networks

Abstract

A peer-to-peer network is planned around the concept of equivalent peer nodes simultaneously working one and the other clients and servers to different nodes on the system. Lately, different selfish practices of peer-to-peer (P2P) organize nodes have turned out to be progressively extreme, and the presence of free-riding, whitewashing and so forth falls apart the exhibition of the systems. This exploration tends to the free-riding issue in peer-to-peer systems.Free-riding problem in P2P networks have become increasingly challenging the various attempts to address the problem. Free-riding reduces P2P system’s effectiveness, robustness and worsened network congestion, therefore, leading to system instability (Shahriar and Jaumard, 2017). Many existing works have considered the use of game theory approaches to address the problem of free-riding in the peer-to-peer network. Some of the mechanisms of game theory used by many researchers can somehow detect and punish free-riders in P2P networks at the expense of overload of peers and the suffering of bandwidth with the slowness of the communication between peers.This paper presents a new mechanism of the stochastic model of Ayo game theoretic to restrain free riding in partially centralized P2P in second generation of unstructured of P2P network.