An optimal approximation of the characteristics of the GI/M/1 queue with two-stage service policy

Original Paper
First Online:
Received:
Revised:
Accepted:
  • 107 Downloads

Abstract

In this paper, we consider an GI/M/1 system with two-stage service policy, having a service rate \((\mu _1, \mu _2)\), for which we determine its global transition operator. After that, with using the strong stability method we establish the approximation conditions for the stationary characteristics of this system by those of the standard GI/M/1 system. Under assumption that the approximation conditions are satisfied, we give the estimate of the deviation (stability inequalities) between the stationary distribution of the GI/M/1 system with two-stage service policy and those of the standard GI/M/1 system for three considered cases: the standard system has a service rate \(\mu _1\) (minimal threshold policy), the standard system has a service rate \(\mu _2\) (maximal threshold policy) and the standard system has a service rate \(\mu ^*\) minimizing the deviation (optimal policy). To calculate these deviations, the situation is modeled by a mathematical optimization problem which belongs to the minimization of a constrained nonlinear multi-variable function. Finally, numerical studies are performed to support the theoretical obtained results.

Keywords

Hysteretic queue Markov chain Perturbation Approximation Strong stability Constrained nonlinear optimization 
This is a preview of subscription content, log in to check access.

References

  1. Aïssani D, Kartashov NV (1983) Ergodicity and stability of Markov chains with respect to operator topology in the space of transition kernels. Doklady Akademii Nauk Ukrainskoi S.S.R. seriya A 11:3–5Google Scholar
  2. Artalejo JR (1992) A unified cost function for \(M/G/1\) queueing systems with removable server. Trabajos de Investigacion Operativa 7(1):95–104CrossRefGoogle Scholar
  3. Artalejo JR, Economou A (2005) Markovian controllable queueing systems with hysteretic policies: busy period and waiting time analysis. Methodol Comput Appl Probab 7:353–378CrossRefGoogle Scholar
  4. Bareche A, Aïssani D (2011) Statistical techniques for a numerical evaluation of the proximity of \(G/G/1\) and \(G/M/1\) queueing systems. Comput Math Appl 61(5):1296–1304CrossRefGoogle Scholar
  5. Benaouicha M, Aïssani D (2005) Strong stability in a \(G/M/1\) queueing system. Theory Probab Math Stat 71:25–36CrossRefGoogle Scholar
  6. Biggs MC (1975) Constrained minimization using recursive quadratic programmin. In: Dixon LCW, Szergo GP (eds) Towards global optimization. North Holland, Amsterdam, pp 341–349Google Scholar
  7. Choudhury G, Madan KC (2005) A two-stage batch arrival queueing system with a modified bernoulli schedule vacation under \(N\)-policy. Math Comput Model 42:71–85CrossRefGoogle Scholar
  8. Chydzinski A (2004) The oscillating queue with finite buffer. Perform Eval 57(3):341–355CrossRefGoogle Scholar
  9. Crabill T, Gross D, Magazine M (1977) A classified bibliography of research on optimal design and control of queues. Oper Res 25:219–232CrossRefGoogle Scholar
  10. Doshi BT (1986) Queueing systems with vacations. Queueing Syst 1:29–66CrossRefGoogle Scholar
  11. Doshi BT (1991) Analysis of a two phase queueing system with general service time. Oper Res Lett 10:265–272CrossRefGoogle Scholar
  12. Dudin AN, Klimenok VI (1991) Optimization of dynamic control of input load at a node of a computer/information network. Autom Control Comput Sci 25(2):19–25Google Scholar
  13. Gupta SM, Kavusturucu A (2000) Production systems with interruptions, arbitrary topology and finite buffers. Ann Oper Res 93:145–176CrossRefGoogle Scholar
  14. Heyman DP (1968) Optimal operating policies for \(M/G/1\) queueing systems. Oper Res 16:362–382CrossRefGoogle Scholar
  15. Hock W, Schittkowski K (1983) A comparative performance evaluation of 27 nonlinear programming codes. Computing 30:335–358CrossRefGoogle Scholar
  16. Kartashov NV (1996) Strong stable Markov chains. VSP/TBiMC, Utrecht/KievGoogle Scholar
  17. Ke JC (2001) The control policy of an \(M^{[X]}/G/1\) queueing system with server startup and two vacation types. Math Methods Oper Res 54:471–490CrossRefGoogle Scholar
  18. Ke JC, Chu YK (2008) Optimization on bicriterion policies for \(M/G/1\) system with second optional service. J Zhejiang Univ Sci A 9(10):1437–1445CrossRefGoogle Scholar
  19. Kempa WM (2015) Time-dependent analysis of transmission process in a wireless sensor network with energy saving mechanism based on threshold waking up. In: 2015 IEEE 16th international workshop on signal processing advances in wireless communications (SPAWC) (SPAWC 2015), Stockholm, Sweden, June 28–July 1, 2015. Institute of Electrical and Electronics Engineers, Piscataway, pp 26–30Google Scholar
  20. Kempa WM, Wozniak M, Nowicki RK, Gabryel M, Damasevicius R (2016) Transient solution for queueing delay distribution in the \(GI/M/1/K\)-type mode with “queued” waking up and balking. In: Rutkowski L, Korytkowski M, Scherer R, Tadeusiewicz R, Zadeh LA, Zurada JM (eds) Artificial intelligence and soft computing. 15th international conference, ICAISC 2016, Zakopane, Poland, June 12–16, 2016. Proceedings of the Pt. 2 (LNCS vol. 9693). Springer, Cham, pp 340–351Google Scholar
  21. Kim S, Kim J, Lee EY (2006) Stationary distribution of queue length in \(G/M/1\) queue with two-stage service policy. Math Methods Oper Res 64:467–480CrossRefGoogle Scholar
  22. Krishna CM, Lee YH (1990) A study of two phase service. Oper Res Lett 9:91–97CrossRefGoogle Scholar
  23. Madan KC (2000) On a single server queue with two stage general heterogeneous service and binomial schedule server vacations. Egypt Stat J 44:39–55Google Scholar
  24. Madan KC (2001) On a single server queue with two stage general heterogeneous service and deterministic server vacations. Int J Syst Sci 32:837–844CrossRefGoogle Scholar
  25. Moré JJ, Sorensen DC (1983) Computing a trust region step. SIAM J Sci Stat Comput 3:553–572CrossRefGoogle Scholar
  26. Powell MJD (1978) A fast algorithm for nonlinearly constrained optimization calculations. In: Watson GA (ed) Numerical analysis. Lecture notes in mathematics, vol 630. Springer, Berlin, pp 144–157Google Scholar
  27. Sennott LI (1999) Stochastic dynamic programming and the control of queueing systems. Wiley, New YorkGoogle Scholar
  28. Tadj L, Choudhury G (2005) Optimal design and control of queues. Top 13(2):359–414CrossRefGoogle Scholar
  29. Tadj L, Ke JC (2003) Control policy of a hysteretic queueing system. Math Methods Oper Res 57(3):367–376CrossRefGoogle Scholar
  30. Teghem J (1986) Control of the service process in a queueing system. Eur J Oper Res 23:141–158CrossRefGoogle Scholar
  31. Wang KH (1997) Optimal control of an \(M/E_k/1\) queueing system with removable service station subject to breakdowns. J Oper Res Soc 48:936–942CrossRefGoogle Scholar
  32. Wang KH, Kao HT, Chen G (2004) Optimal management of a removable and non-reliable server in an infinite and a finite \(M/H_k/1\) queueing system. Quality Technol Quant Manag 1:325–339CrossRefGoogle Scholar
  33. Yadin M, Naor P (1963) Queueing systems with a removable service station. Oper Res Q 14:393–405CrossRefGoogle Scholar
  34. Zhang ZG, Tian N (2004) The \(N\) threshold policy for the \(G/M/1\) queue. Oper Res Lett 32:77–84CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Research Unit LaMOS (Modeling and Optimization of Systems)University of BejaiaBejaiaAlgeria
  2. 2.Department of MathematicsUniversity of BiskraBiskraAlgeria

Personalised recommendations