Cooperative friendship networks through SLAC with Newscast

Abstract

The effective cooperation and coordination of nodes is necessary for performance improvement in the P2P network. In this paper, we focus on the problem of maintaining considerable amount of cooperation and friendship in P2P networks of selfish peers. For this purpose we will analyze the performance of SLAC. It is a simple algorithm that maintains excessive levels of cooperation and friendship in a network while performing tasks. A simulation model “Prisoners' Dilemma” is presented that puts this algorithm to work in a Peersim environment. For providing random sampling, an existing protocol called “NEWSCAST” has been used. The extensive computer simulations show that the technique is scalable, robust and decentralized.