A game theoretic framework for bandwidth allocation and pricing in broadband networks

In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed networks. The framework is based on the idea of the Nash bargaining solution from cooperative game theory, which not only provides the rate settings of users that are Pareto optimal from the point of view of the whole system, but are also consistent with the fairness axioms of game theory. We first consider the centralized problem and then show that this procedure can be decentralized so that greedy optimization by users yields the system optimal bandwidth allocations. We propose a distributed algorithm for implementing the optimal and fair bandwidth allocation and provide conditions for its convergence. The paper concludes with the pricing of elastic connections based on users' bandwidth requirements and users' budget. We show that the above bargaining framework can be used to characterize a rate allocation and a pricing policy which takes into account users' budget in a fair way and such that the total network revenue is maximized.

[1]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[2]  K. Bharath-Kumar,et al.  A new approach to performance-oriented flow control , 1981, IEEE Trans. Commun..

[3]  Pradeep Dubey,et al.  Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..

[4]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Richard K. Moore,et al.  From theory to applications , 1986 .

[7]  E. Damme.  Stability and perfection of Nash equilibria , 1987 .

[8]  E. Vandamme.  Stability and perfection of nash equilibria , 1987 .

[9]  C. Douligeris.  Optimal flow control and fairness in communication networks--a game theoretic perspective , 1990 .

[10]  Christos Douligeris,et al.  Efficient flow control in a multiclass telecommunications environment , 1991 .

[11]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[12]  J. Aubin.  Optima and Equilibria , 1993 .

[13]  T Itu,et al.  Traffic control and congestion control in b-isdn , 1993 .

[14]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[15]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..

[16]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[17]  Raj Jain.  Congestion Control and Traffic Management in ATM Networks: Recent Advances and a Survey , 1996, Comput. Networks ISDN Syst..

[18]  George D. Stamoulis,et al.  Integration of pricing and flow control for available bit rate services in ATM networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[19]  Song Chong,et al.  Rate control algorithms for the ATM ABR service , 1997, Eur. Trans. Telecommun..

[20]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[21]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[22]  Catherine Rosenberg,et al.  A game theoretic framework for rate allocation and charging of available bit rate (ABR) connections in ATM networks , 1998, Broadband Communications.

[23]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[24]  A. Muthoo.  Bargaining Theory with Applications , 1999 .

[25]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[26]  Catherine Rosenberg,et al.  Distributed algorithms for fair bandwidth allocation to elastic services in broadband networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[27]  R. Inderst.  Bargaining Theory with Applications , 2002 .