Dynamic service sharing with heterogeneous preferences

We consider a service system where individual users share a common resource, modeled as a processor-sharing queue. Arriving users observe the current load in the system, and should decide whether to join it or not. The motivation for this model is based, in part, on best-effort service classes in computer communication networks. This decision problem is modeled as a noncooperative dynamic game between the users, where each user will enter the system only if its expected service time (given the system description and policies of subsequent users) is not larger than its quality of service (QoS) requirement. The present work generalizes previous results by Altman and Shimkin (1998), where all users were assumed identical in terms of their QoS requirements and decision policies; here we allow heterogeneous requirements, hence different policies. The main result is the existence and uniqueness of the equilibrium point in this system, which specifies a unique threshold policy for each user type. Computation of the equilibrium thresholds are briefly discussed, as well as dynamic learning schemes which motivate the Nash equilibrium solution for this system.

[1]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[2]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[3]  Eitan Altman,et al.  Flow control using the theory of zero sum Markov games , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[4]  P. Naor.  The Regulation of Queue Size by Levying Tolls , 1969 .

[5]  Uri Yechiali,et al.  On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing Process , 1971, Oper. Res..

[6]  Ariel Orda,et al.  Virtual path bandwidth allocation in multiuser networks , 1997, TNET.

[7]  Jr. Shaler Stidham.  Optimal control of admission to a queueing system , 1985 .

[8]  Moshe Haviv,et al.  Reneging from Processor Sharing Systems and Random Queues , 1990, Math. Oper. Res..

[9]  Ariel Orda,et al.  Virtual path bandwidth allocation in multi-user networks , 1995, Proceedings of INFOCOM'95.

[10]  Avishai Mandelbaum,et al.  A model for rational abandonments from invisible queues , 2000, Queueing Syst. Theory Appl..

[11]  Moshe Haviv.  Stable strategies for processor sharing systems , 1991 .

[12]  U. Yechiali.  Customers' Optimal Joining Rules for the GI/M/s Queue , 1972 .

[13]  Harold J. Kushner,et al.  Stochastic approximation and user adaptation in a competitive resource sharing system , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[14]  Christos Douligeris,et al.  Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment , 1992, IEEE Trans. Commun..

[15]  Eitan Altman,et al.  Individual Equilibrium and Learning in Processor Sharing Systems , 1998, Oper. Res..

[16]  Aurel A. Lazar,et al.  Optimal Decentralized Flow Control of Markovian Queueing Networks with Multiple Controllers , 1991, Perform. Evaluation.

[17]  Aurel A. Lazar,et al.  On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.

[18]  Ariel Orda,et al.  Best-effort resource sharing by users with QoS requirements , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[19]  Anastasios A. Economides,et al.  Multi-objective routing in integrated services networks: A game theory approach , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.