A Mathematical Framework for Analyzing Adaptive Incentive Protocols in P2P Networks
In P2P networks, incentive protocol is used to encourage cooperation among end nodes so as to deliver a scalable and robust service. However, the design and analysis of incentive protocols have been ad hoc and heuristic at best. The objective of this paper is to provide a simple, yet general framework to analyze and design incentive protocols. The authors consider a class of incentive protocols which can learn and adapt to other end nodes' strategies. Based on their analytical framework, one can evaluate the expected performance gain, and more importantly, the system robustness of a given incentive protocol.