Individually and socially optimal joining rules for an egalitarian processor-sharing queue under different information scenarios

Optimal joining rules for processor-sharing queue under different information levels are considered.Employing left-multiplication transformation, the expected conditional sojourn time is obtained.Socially optimal threshold is no longer a lower bound for the individually optimal threshold.Equilibrium and socially optimal mixed strategies are derived in fully unobservable case. This paper studies joining behavior of customers into an M / M / 1 egalitarian processor-sharing (PS) queue. By constructing a left-multiplication transformation and using its matrix representation, we obtain the expected conditional sojourn time of a tagged customer. Then, in the fully observable case, we first consider the joining strategy in a decentralized manner, that is, arriving customers observe the queue size and then decide whether or not to join the queue based on the net benefit they will obtain upon the completion of service. Secondly, we derive the threshold strategy that will yield the system's maximal expected profit, to reach the so-called social welfare optimization. Finally, Nash equilibrium and socially optimal mixed strategies are derived in the fully unobservable case. Moreover, some numerical examples are provided to explore the impact of system parameters on customer's joining behavior.

[1]  Pengfei Guo,et al.  Analysis and Comparison of Queues with Different Levels of Delay Information , 2007, Manag. Sci..

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

[3]  Feng Zhang,et al.  Equilibrium Analysis of the Observable Queue with Balking and Delayed Repairs , 2010, 2010 Third International Joint Conference on Computational Science and Optimization.

[4]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

[5]  Bin Liu,et al.  Equilibrium balking strategies in Markovian queues with working vacations , 2013 .

[6]  Antonis Economou,et al.  Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs , 2008, Oper. Res. Lett..

[7]  Feng Zhang,et al.  Equilibrium customer strategies in Markovian queues with partial breakdowns , 2013, Comput. Ind. Eng..

[8]  Eitan Altman,et al.  A survey on discriminatory processor sharing , 2006, Queueing Syst. Theory Appl..

[9]  Antonis Economou,et al.  Optimal balking strategies and pricing for the single server Markovian queue with compartmented waiting space , 2008, Queueing Syst. Theory Appl..

[10]  Wei Sun,et al.  Equilibrium and optimal behavior of customers in Markovian queues with multiple working vacations , 2014 .

[11]  Yan Ma,et al.  Equilibrium threshold strategies in observable queueing systems under single vacation policy , 2012 .

[12]  Tetsuya Takine,et al.  Sojourn time distribution in a MAP/M/1 processor-sharing queue , 2003, Oper. Res. Lett..

[13]  Antonis Economou,et al.  Optimal and equilibrium balking strategies in the single server Markovian queue with catastrophes , 2012, Eur. J. Oper. Res..

[14]  Refael Hassin,et al.  Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers , 2012, Eur. J. Oper. Res..

[15]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[16]  V. Ramaswami.  THE SOJOURN TIME IN THE GI/M/1 QUEUE , 1984 .

[17]  Quan-Lin Li,et al.  An RG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue , 2005 .

[18]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[19]  Yan Ma,et al.  Equilibrium balking behavior in the Geo/Geo/1 queueing system with multiple vacations , 2013 .

[20]  Leonard Kleinrock,et al.  Time-shared Systems: a theoretical treatment , 1967, JACM.

[21]  D. K. Hildebrand,et al.  Congestion Tolls for Poisson Queuing Processes , 1975 .

[22]  R. Schassberger,et al.  A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[23]  Antonis Economou,et al.  Equilibrium balking strategies for a clearing queueing system in alternating environment , 2013, Ann. Oper. Res..

[24]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[25]  R. Núñez-Queija.  SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING , 2001 .

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

[27]  Teunis J. Ott,et al.  The sojourn-time distribution in the M/G/1 queue by processor sharing , 1984, Journal of Applied Probability.

[28]  FABRICE GUILLEMIN,et al.  Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory , 2001, Queueing Syst. Theory Appl..

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

[30]  David L. Jagerman.  Difference equations with applications to queues , 2000 .

[31]  Naishuo Tian,et al.  Equilibrium threshold strategies in observable queueing systems with setup/closedown times , 2010, Central Eur. J. Oper. Res..

[32]  Refael Hassin,et al.  Strategic Behavior and Social Optimization in Markovian Vacation Queues , 2011, Oper. Res..

[33]  Antonis Economou,et al.  Equilibrium customer strategies in a single server Markovian queue with setup times , 2007, Queueing Syst. Theory Appl..