A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks論文的結論：
In this paper, we present a P2P network protocol that provides service differentiation and gives incentive for nodes to share information and provide services.
The solution consists of the resource allocation mechanism RBM-IU and the interaction protocol for competing nodes to reach equilibria of the competition game induced by RBM-IU.
The solution is efficient: (1) RBM-IU can be implemented by a linear time algorithm, (2) the feedback based bidding messages used by competing nodes are simple, and (3) RBM-IU achieves Pareto-optimal allocation results.
The robustness of the solution is evidenced by the fact that all competing nodes can reach the equilibrium solutions of the competition game.
The justification for the source node to use our protocol is its guarantee of Pareto optimality.
On the other hand, competing nodes are motivated to use the protocol because it guarantees Nash equilibrium.
We also show that the protocol is adaptive to various node arrival and departure events, and to different forms of network congestion.
No comments:
Post a Comment