Exchange-based incentive mechanisms for peer-to-peer file sharing
ABSTRACT Performance of peer-to-peer resource sharing networks depends upon the level of cooperation of the participants. To date, cash-based systems have seemed too complex, while lighter-weight credit mechanisms have not provided strong incentives for cooperation. We propose exchange-based mechanisms that provide incentives for cooperation in peer-to-peer file sharing networks. Peers give higher service priority to requests from peers that can provide a simultaneous and symmetric service in return. We generalize this approach to n-way exchanges among rings of peers and present a search algorithm for locating such rings. We have used simulation to analyze the effect of exchanges on performance. Our results show that exchange-based mechanisms can provide strong incentives for sharing, offering significant improvements in service times for sharing users compared to free-riders, without the problems and complexity of cash- or credit-based systems.
SourceAvailable from: thinkmind.org[Show abstract] [Hide abstract]
ABSTRACT: Free riders in the Peer-to-Peer systems are the nodes that only consume services but provide little or nothing in return. They seriously degrade the fault-tolerance, scalability and content availability of the Peer-to-Peer systems. The solution to this problem in Peer-to-Peer networks is to have incentive mechanisms that aim to improve the network utility by influencing the nodes to be more cooperative. This paper presents seven design requirements according to the characteristics of Peer-to-Peer systems, latest distributed computing development trends and implementation techniques. This paper also provides a classification of the existing incentive mechanisms for Peer-to-Peer systems. For each category, the paper outlines the principles, provides typical examples, applications and discusses limitations against proposed design requirements. Two approaches to evaluate the effectiveness of the incentive mechanism are also presented. The findings suggest that the reciprocity-based incentive mechanisms are the most promising solutions. It is suggested that future research direction could focus more on the internal factors that encourage cooperation.
Article: Optimizing Scrip Systems[Show abstract] [Hide abstract]
ABSTRACT: A model of providing service in a P2P network is analyzed. It is shown that by adding a scrip system, a mechanism that admits a reasonable Nash equilibrium that reduces free riding can be obtained. The effect of varying the total amount of money (scrip) in the system on efficiency (i.e., social welfare—the total utility of all the agents in the system) is analyzed, and it is shown that by maintaining the appropriate ratio between the total amount of money and the number of agents, efficiency is maximized. The work has implications for many online systems, not only P2P networks but also a wide variety of online forums for which scrip systems are popular, but formal analyses have been lacking.
[Show abstract] [Hide abstract]
ABSTRACT: In recent years, peer-to-peer (P2P) network systems have been widely used in the Internet. Particularly, P2P file sharing mechanism has emerged popularity and attract millions of users. However, to create an efficient P2P system, end users should share their resources among a group of other users. To satisfy this objective, this paper applies the repeated public goods game model to P2P systems. By adopting an interactive self-learning mechanism, the proposed scheme gradually leads the P2P system into an efficient network equilibrium. In a distributed manner, our approach is a practical and suitable method in real world P2P network operations. With a simulation study, it is demonstrated that the proposed scheme can obtain better performance than other existing schemes under widely diverse file request rates.Wireless Personal Communications 11/2014; 79(1):473-485. DOI:10.1007/s11277-014-1868-y · 0.98 Impact Factor
Michael B. Greenwald