## A game theoretic framework for bandwidth allocation and pricing in broadband networks (2000)

Venue: | IEEE/ACM TRANSACTIONS ON NETWORKING |

Citations: | 177 - 5 self |

### BibTeX

@ARTICLE{Yaiche00agame,

author = {Haikel Yaiche and Ravi R. Mazumdar and Catherine Rosenberg},

title = {A game theoretic framework for bandwidth allocation and pricing in broadband networks},

journal = {IEEE/ACM TRANSACTIONS ON NETWORKING},

year = {2000},

volume = {8},

pages = {667--678}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed net-works. 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.

### Citations

1788 |
Data Networks
- Bertsekas, Gallagher
- 1991
(Show Context)
Citation Context ...f fairness. This, in general, is a loose term and there are many notions of fairness. One of the commonly used notions is that of fairness which penalizes large users. From the definition of fairness =-=[3]-=-, it can be seen that it corresponds to a Pareto optimum. However, it is not easy to take into account the notions that users might have different requirements within this framework. A much more satis... |

1367 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maullo, et al.
- 1998
(Show Context)
Citation Context ...eeded, while at the user level, information about all other connections which affect the given connection is needed. 1 In [30], we also propose an algorithm which is based on the primal problem as in =-=[18]-=-, but which requires much more information exchange than the one we present here.YAÏCHE et al.: GAME THEORETIC FRAMEWORK FOR BANDWIDTH ALLOCATION AND PRICING 673 We now discuss the framework and algo... |

745 |
Nonlinear Programming
- Bertsekas
- 2004
(Show Context)
Citation Context ...achieves the desired bandwidth allocations that are Pareto optimal and fair. This algorithm is based on the gradient of the dual of the basic optimization problem which results when computing the NBS =-=[2]-=-. The algorithm proposed in [21] is also based on the dual of the social optimum problem with second-order differentiability or assumptions on the user utility functions. The performance functions we ... |

689 | Charging and rate control for elastic traffic
- Kelly
- 1997
(Show Context)
Citation Context ...ms which adapt quickly to congestion while trying to be fair in a so-called sense [5], [13], [16]. This notion of fairness is different from the notion of the solutions in game theory. More recently, =-=[17]-=-, [18] and [21] have considered the problem of rate allocation and charging based on knowledge of user utility functions. All consider the issue of maximizing the social benefit, which is the sum of t... |

670 |
The bargaining problem
- Nash
- 1950
(Show Context)
Citation Context ...this paper, we propose a game theoretic framework, which is very powerful, to address the above issues. In particular, by drawing upon the Nash bargaining framework from cooperative game theory [24], =-=[25]-=-, we show that one can obtain a unified framework in which we can address issues of network efficiency, fairness, revenue maximization, and pricing. The advantage of such a framework is that we have p... |

514 | Optimization flow control, I. Basic algorithm and convergence
- Low, Lapsley
- 1999
(Show Context)
Citation Context ...quickly to congestion while trying to be fair in a so-called sense [5], [13], [16]. This notion of fairness is different from the notion of the solutions in game theory. More recently, [17], [18] and =-=[21]-=- have considered the problem of rate allocation and charging based on knowledge of user utility functions. All consider the issue of maximizing the social benefit, which is the sum of the user utiliti... |

370 | Fundamental design issues for the future Internet
- Shenker
- 1995
(Show Context)
Citation Context ... network allocates the bandwidth accordingly, while in [21] the network charges a price based on user bandwidth demands. The combination of flow control and pricing has also been addressed in [6] and =-=[26]-=-. The utility function approach used in [17] and [21] suffers from the point of view that user utilities or preferences are only known in some qualitative sense. Thus, although reasonable assumptions ... |

157 | Congestion Control and Traffic Management in ATM Networks: Recent advances and a survey
- Jain
- 1996
(Show Context)
Citation Context ...s been the focus of much attention. In the ATM ABR context the primary concern has been to develop algorithms which adapt quickly to congestion while trying to be fair in a so-called sense [5], [13], =-=[16]-=-. This notion of fairness is different from the notion of the solutions in game theory. More recently, [17], [18] and [21] have considered the problem of rate allocation and charging based on knowledg... |

151 |
Bargaining Theory with Applications
- Muthoo
- 1999
(Show Context)
Citation Context ...e. In this paper, we propose a game theoretic framework, which is very powerful, to address the above issues. In particular, by drawing upon the Nash bargaining framework from cooperative game theory =-=[24]-=-, [25], we show that one can obtain a unified framework in which we can address issues of network efficiency, fairness, revenue maximization, and pricing. The advantage of such a framework is that we ... |

148 |
Fendick, “The rate-based flow control framework for the available bit rate ATM service
- Bonomi, W
- 1995
(Show Context)
Citation Context ... sources has been the focus of much attention. In the ATM ABR context the primary concern has been to develop algorithms which adapt quickly to congestion while trying to be fair in a so-called sense =-=[5]-=-, [13], [16]. This notion of fairness is different from the notion of the solutions in game theory. More recently, [17], [18] and [21] have considered the problem of rate allocation and charging based... |

136 |
Stability and perfection of Nash equilibria
- DAMME
- 1996
(Show Context)
Citation Context ... important issue is whether such a computation can be decentralized at a user level in which the user tries to optimize its performance greedily. In general, greedy procedures lead to Nash equilibria =-=[28]-=- which, being Pareto inefficient, are not NBSs. Thus, clearly, users must use modified criteria if the greedy optimization is to lead to the NBS for the network. The answer to the above question is in... |

108 |
Mathematical Programming: Theory and Algorithms
- Minoux
- 1986
(Show Context)
Citation Context ...MR is strictly concave.YAÏCHE et al.: GAME THEORETIC FRAMEWORK FOR BANDWIDTH ALLOCATION AND PRICING 671 Noting that the constraints are linear in and is , it implies that the first-order Kuhn–Tucker =-=[23]-=- conditions are necessary and sufficient for optimality. Let denote the Lagrangian where , ; , and ; denote the Lagrange multipliers associated with the MR, PR, and capacity constraints respectively. ... |

70 |
Inefficiency of Nash equilibria
- Dubey
- 1986
(Show Context)
Citation Context ...reto optimality and fairness property associated with NBSs. It is important to note that NBSs are not related to Nash equilibria which (except in the case of inessential games) are Pareto inefficient =-=[11]-=-, [1]. Nash equilibria are important in that they arise in the context of greedy optimization. The definition of a Nash bargaining point is highly dependent on the consideration of an initial performa... |

65 |
Fairness in Network Optimal Flow Control: Optimality of Product Forms
- Mazumdar, Mason, et al.
- 1991
(Show Context)
Citation Context ...sed on the use of game theory and gave a characterization for some candidate points. Some of them considered Nash equilibrium points [4], [10] and others considered Pareto-optimal points [8], [9]. In =-=[22]-=-, the Nash bargaining point was proposed as a suitable solution for the design of an optimal and fair flow control. As in [22], we consider the Nash bargaining point as the desired point for the opera... |

29 | Stamoulis, “Integration of pricing and flow control for available bit rate services
- Courbetis, Siris, et al.
- 1996
(Show Context)
Citation Context ... and the network allocates the bandwidth accordingly, while in [21] the network charges a price based on user bandwidth demands. The combination of flow control and pricing has also been addressed in =-=[6]-=- and [26]. The utility function approach used in [17] and [21] suffers from the point of view that user utilities or preferences are only known in some qualitative sense. Thus, although reasonable ass... |

19 |
The arbitrated solution for multiobjective convex programming. Revue Roumaine de Mathematical Pures et Appliquees
- Stefanescu, Stefanescu
- 1984
(Show Context)
Citation Context ...e the optimal point as follows: Definition 2.3: Let be given by . Then is the (Nash) bargaining point and is called the set of the (Nash) bargaining solutions. The following result, due to Stefanescu =-=[27]-=-, provides for a characterization of the Nash bargaining point and will form the basis for the results in the sequel. Theorem 2.1: Let , be concave upper-bounded functions defined on which is a convex... |

12 |
On Pareto-optimal flow control in an integrated environment
- Douligeris, Mazumdar
- 1986
(Show Context)
Citation Context ...the development of local optimization procedures which lead to Pareto-optimal solutions (the local procedures being greedy schemes) were studied in a series of papers by Douligeris and Mazumdar [10], =-=[8]-=-, [9] in the context of data networks. This paper is thus an extension of those ideas as well as a new approach in the context of elastic services in broadband networks. Preliminary results have been ... |

10 | Rate control algorithms for the ATM ABR service - Hernandez-Valencia, Benmohamed, et al. - 1997 |

9 |
A game theoretic framework for rate allocation and charging of available bit rate (ABR) connections in ATM networks
- Yaiche, Mazumdar, et al.
- 1998
(Show Context)
Citation Context ...context of data networks. This paper is thus an extension of those ideas as well as a new approach in the context of elastic services in broadband networks. Preliminary results have been presented in =-=[29]-=- and [30]. The issue of rate control for elastic sources has been the focus of much attention. In the ATM ABR context the primary concern has been to develop algorithms which adapt quickly to congesti... |

6 |
A new approach to performance oriented flow control
- Bharathkumar, Jaffe
- 1981
(Show Context)
Citation Context ...t of flow control in packet-switched networks, many schemes were based on the use of game theory and gave a characterization for some candidate points. Some of them considered Nash equilibrium points =-=[4]-=-, [10] and others considered Pareto-optimal points [8], [9]. In [22], the Nash bargaining point was proposed as a suitable solution for the design of an optimal and fair flow control. As in [22], we c... |

6 | Nonlinear Systems. Englewood Cliffs - Khalil - 1995 |

6 |
Rate control algorithms for the ATM
- Hernandez-Valencia, Benmohamed, et al.
- 1997
(Show Context)
Citation Context ...ces has been the focus of much attention. In the ATM ABR context the primary concern has been to develop algorithms which adapt quickly to congestion while trying to be fair in a so-called sense [5], =-=[13]-=-, [16]. This notion of fairness is different from the notion of the solutions in game theory. More recently, [17], [18] and [21] have considered the problem of rate allocation and charging based on kn... |

4 | Stamoulis, "Integration of pricing and flow control for available bit-rate services in ATM networks - Courcoubetis, Siris, et al. |

4 |
Optimal Flow Control and Fairness in Communication Networks: A Game Theoretic Perspective
- Douligeris
- 1989
(Show Context)
Citation Context ...l of the weighted sum of the original objective functions, the weights being the penalties. Such an idea has also been discussed in the context of packet-switched networks in the thesis of Douligeris =-=[7]-=-, where the decentralized procedure attempts to arrive at the centralized or Pareto-optimal flow control settings via the imposition of penalties. In the decentralized model, each connection can optim... |

3 | Distributed algorithms for fair bandwidth allocation to elastic services in broadband networks
- Yaiche, Mazumdar, et al.
- 1996
(Show Context)
Citation Context ...f data networks. This paper is thus an extension of those ideas as well as a new approach in the context of elastic services in broadband networks. Preliminary results have been presented in [29] and =-=[30]-=-. The issue of rate control for elastic sources has been the focus of much attention. In the ATM ABR context the primary concern has been to develop algorithms which adapt quickly to congestion while ... |

2 |
on Pareto-optimal flow control
- “More
- 1987
(Show Context)
Citation Context ...evelopment of local optimization procedures which lead to Pareto-optimal solutions (the local procedures being greedy schemes) were studied in a series of papers by Douligeris and Mazumdar [10], [8], =-=[9]-=- in the context of data networks. This paper is thus an extension of those ideas as well as a new approach in the context of elastic services in broadband networks. Preliminary results have been prese... |

2 | Fixed-point models and congestion pricing for TCP and related schemes,” presented at the Workshop Mathematical Modeling of TCP - Key |

1 |
Optima and Equilibria, GTM 140
- Aubin
- 1998
(Show Context)
Citation Context ...ANSACTIONS ON NETWORKING, VOL. 8, NO. 5, OCTOBER 2000 This follows from the fact that every Pareto point can be obtained as the solution to the maximization of the sum of the weighted objectives (see =-=[1]-=-). III. OPTIMAL AND FAIR BANDWIDTH ALLOCATION FOR ELASTIC CONNECTIONS It is natural to adopt a game theory approach to model and address the issue of network resource allocation. In the context of flo... |

1 | Fundamental design issues forthe future lnternet - Shenker - 1995 |

1 |
optimal flow Control in an integrated environment
- “User
- 1988
(Show Context)
Citation Context ...ll as the development of local optimization procedures which lead to Pareto-optimal solutions (the local procedures being greedy schemes) were studied in a series of papers by Douligeris and Mazumdar =-=[10]-=-, [8], [9] in the context of data networks. This paper is thus an extension of those ideas as well as a new approach in the context of elastic services in broadband networks. Preliminary results have ... |