Abstract
In the emerging wireless ATM networks, resource allocation with handoff consideration plays an important role in the quality of service (QoS) guarantee for multiple traffic sources. As efficiency is an important performance issue which is most widely used, the concept of fairness should also be considered. In this paper we investigate a fair and efficient resource allocation scheme for two types of traffics contending for the shared network resource. Based on the cooperative game theory, we model the fair and efficient allocation problem as a typical bargaining and arbitration problem, while the issues of efficiency and fairness are considered simultaneously by using the axiom approach. By modeling the corresponding queuing system as a Markov chain and using the Markov decision process (MDP) analysis, we convert the solution of optimal allocation policies into a typical linear programming problem for which the well-known simplex type algorithms can be easily implemented. Simulation results are also provided.
Xinjie Chang is currently working in the Information & Telecommunication Technology Center (ITTC), University of Kansas and can be reached at: changxj@ittc.ukans.edu.
Chapter PDF
Similar content being viewed by others
Keywords
- Markov Decision Process
- Resource Allocation Scheme
- Bargaining Problem
- Handoff Call
- Cooperative Game Theory
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. P. Pollini, “Trends in Handover Design”, IEEE Communications Magazine, Vol. 34, No.3, 1996
Xinjie, Chang, K.R. Subramanian, “Call Admission Control Policies for ATM Networks”, WmATM’99, June, 1999, Silicon Valley, San Jose, USA,1999
Z. Dziong, L. G. Mason, “Fair-Efficient Call Admission Control Policies for Broadband Networks-A Game Theoretic Framework”, IEEE/ACM Transactions on Networking, Vol. 4, No.1,1996
Alvin E. Roth, “Game-theoretic models of bargaining”, Camb. [Cambridge], New York: Cambridge University Press, 1985.
Luce R. Duncan, Raiffa, Howard, “Games and Decisions: Introduction and Critical Survey”, New York: Dover Publications, 1989, c1957.
X. Cao, “Preference Function and Bargaining Solution”, Proceeding of IEEE CDC, 1982
Cong Li, “A Study on Dynamic Resource Allocation and Handoff in Cellular Radio System”, M. Eng. Thesis, School of EEE, Nanyang Technological University, Aug, 1997
T. Oda, Yu Watanabe, “Optimal Trunk Reservation for a Group with Multi-slot Traffic Streams”, IEEE Transaction On Communications”, Vol.38, No.7, 1990
OPNET 3.5.A User Manual, MIL3 Company, 1997
D. Douligeris, R. Mazumdar, “More On Pareto-Optimal Flow Control”, 26th Annual Alleton Conference on Communication, Control ad Computing, 1988
D. Douligeris, R. Mazumdar, “On Pareto-Optimal Flow Control in a Multiclass Environment”, 25th Annual Alleton Conference on Communication, Control ad Computing, 1987
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, X., Subramanian, K.R. (2000). A Cooperative Game Theory Approach to Resource Allocation in Wireless ATM Networks. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_81
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive