Bandwidth allocation is one of the important research issues in peer-to-peer (P2P) networks. Many different allocation mechanisms have been proposed to tackle this problem. In this paper we propose the BBM-RPTT mechanism that models the allocation process as a strategic game which has a unique social welfare maximizing (hence Pareto optimal) Nash equilibrium, at which each node reveals his true bandwidth demand. Moreover, the mechanism is strategy-proof and collusion-proof. A practical protocol is designed for competing nodes to reach the Nash equilibrium dynamically. Experimental results agree to the theoretical analysis
['Huiye Ma', 'Ho-fung Leung']
A Demand and Contribution Based Bandwidth Allocation Mechanism in P2P Networks: A Game-Theoretic Analysis