Abstract
In this paper we present an abstract, rigorous game-theoretic framework for rate-based control of Available Bit Rate (ABR) services in ATM networks. The framework is based on the idea of the Nash arbitration scheme in cooperative game theory which not only provides the rate settings of users which are Pareto optimal from the network point of view of 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 de-centralized such that users can perform the optimization locally such that the overall rates are network optimal. We then consider the problem of charging of ABR connections considering users’ valuations for the best-effort service. We propose a flat-rate charging policy such that the total network revenue is maximum.
Chapter PDF
Similar content being viewed by others
References
D. Bertsekas and R. Gallager: Data networks. Prentice-Hall, 1987.
K. Bharathkumar and J.M. Jaffe: A new approach to performance oriented flow control. IEEE Trans. Comm., vol. COM-29, April 1981, pp. 427–435.
F. Bonomi and K. W. Fendick: The rate-based flow control framework for available bit rate ATM services, IEEE Network, March/April, 1995.
C. Douligeris and R. Mazumdar: On Pareto-optimal flow control in an integrated environment. Proc. 25th Allerton Conf., Univ. Illinois, Urbana, October 1986.
C. Douligeris and R. Mazumdar: User optimal flow Control in an integrated environment. Proc. Indo-U.S. Workshop on Syst. Signals, Bangalore, India, January 1988.
P. Dubey: Inefficiency of Nash equilibria. Math. Oper. Res., vol. 11, no. 1, pp. 1–8, 1986.
European Transactions on Telecommunications, Focus on Elastic Services over ATM networks,R. Mazumdar and B. Doshi eds., ETT Vol. 8, NO. 1, 1997.
D. Fudenberg and J. Tirole: Game theory, MIT Press, Cambridge, Ma., 1995.
E. J. Hernandez-Valencia, L. Benmohammed, S. Chong and R. Nagarajan: Rate-control algorithms for ATM ABR service, in [10], pp. 7–20.
ITU-T Recommendation I.371: Traffic control and congestion control in B-ISDN, Geneva, June 1996.
F. Kelly: Charging and Rate Control for Elastic Traffic in [10], pp. 33–37
F. Kelly, A. Maulloo and D. Tan: Rate control in communication networks: shadow prices, proportional fairness and stability, pre-print, Statistical Lab., Cambridge, 1997
R. Mazumdar, L. Mason, and C. Douligeris: Fairness in network optimal flow control: optimality of product forms. IEEE Transactions on communications, vol. 39, no. 5, 1991, pp. 775–782.
J. Nash: The bargaining problem,Econometrica, Vol. 18, 1950, pp. 155162:
A. Stefanescu and M.W. Stefanescu: The arbitrated solution for multiobjective convex programming. Rev. Roum. Math. Pure. Appli., vol. 29, pp. 593–598, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Yaiche, H., Mazumdar, R.R., Rosenberg, C. (1998). A game theoretic framework for rate allocation and charging of Available Bit Rate (ABR) connections in ATM networks. In: Kühn, P.J., Ulrich, R. (eds) Broadband Communications. BC 1998. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35378-4_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-35378-4_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4683-9
Online ISBN: 978-0-387-35378-4
eBook Packages: Springer Book Archive