Methodology and Computing in Applied Probability

, Volume 13, Issue 3, pp 563–581 | Cite as

Approximation in the M2/G2/1 Queue with Preemptive Priority

Article

Abstract

The main purpose of this paper is to use the strong stability method to approximate the characteristics of the M2/G2/1 queue with preemptive priority by those of the classical M/G/1 queue. The latter is simpler and more exploitable in practice. After perturbing the arrival intensity of the priority requests, we derive the stability conditions and next obtain the stability inequalities with an exact computation of constants. From those theoretical results, we elaborate an algorithm allowing us to verify the approximation conditions and to provide the made numerical error. In order to have an idea about the efficiency of this approach, we consider a concrete example whose results are compared with those obtained by simulation.

Keywords

Preemptive queue Markov chain Strong stability Perturbation Simulation 

AMS 2000 Subject Classification

60K25 60J25 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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. Dokl Akad Nauk Ukr SSR Ser A 11:3–5Google Scholar
  2. Alfa AS (2009) Matrix-geometric solution of discrete time MAP/PH/1 priority queue. Nav Res Logist 45(1):23–50CrossRefMathSciNetGoogle Scholar
  3. Anisimov VV (1988) Estimates for the deviations of the transition characteristics of non-homogeneous Markov processes. Ukr Math J 40:588–592CrossRefMathSciNetGoogle Scholar
  4. Anisimov VV (2008) Swiching processes in queueing models. Wiley, New YorkCrossRefGoogle Scholar
  5. Cho GE, Meyer CD (2001) Comparison of perturbation bounds for the stationary distribution of a Markov chain. Linear Algebra Appl 335:137–150MATHCrossRefMathSciNetGoogle Scholar
  6. Gómez-Corral A (2002) Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority. Comput Math Appl 43(6–7):767–782MATHCrossRefMathSciNetGoogle Scholar
  7. Heidergott B, Hordijk A (2003) Taylor series expansions for stationary Markov chains. Adv Appl Prob 35:1046–1070MATHCrossRefMathSciNetGoogle Scholar
  8. Heidergott B, Hordijk A, Van Uitert M (2007) Series expansions for finite-state Markov chains. Probab Eng Inf Sci 21:381–400MATHCrossRefGoogle Scholar
  9. Jaiswal NK (1961) Preemptive resume priority queue. Oper Res 6:732–742CrossRefMathSciNetGoogle Scholar
  10. Kartashov NV (1996) Strong stable Markov chains. VSP, UtrechMATHGoogle Scholar
  11. Katayama T, Kobayashi K (2007) Analysis of a nonpreemptive priority queue with exponential timer and server vacations. Perform Eval 64(6):495–506CrossRefGoogle Scholar
  12. Kirkland S (2002) On a question concerning condition numbers for Markov chain. SIAM J Matrix Anal Appl 23:1109–1119MATHCrossRefMathSciNetGoogle Scholar
  13. Liu Z, Wu J (2009) An MAP/G/1 G-queues with preemptive resume and multiple vacations. Appl Math Model 33(3):1739–1748MATHCrossRefMathSciNetGoogle Scholar
  14. Mitrophanov AY (2005) Sensitivity and convergence of uniformly ergodic Markov chains. J Appl Probab 42:1003–1014MATHCrossRefMathSciNetGoogle Scholar
  15. Neumann M, Xu J (2003) Improved bounds for a condition number of Markov chains. Linear Algebra Appl 386:225–241CrossRefMathSciNetGoogle Scholar
  16. Rupert G, Miller J (1960) Priority queues. Ann Math Stat 31(1):86–103MATHCrossRefGoogle Scholar
  17. Rachev ST (1989) The problem of stability in queueing theory. Queueing Syst 4:287–318MATHCrossRefMathSciNetGoogle Scholar
  18. Stoyan D, Daley DJ (1984) Comparison methods for queues and other stochastic models. Wiley, New YorkGoogle Scholar
  19. Wang YC, Liu CW, Lu CC (2000) Loss behavior in space priority queue with batch Markovian arrival process-discrete-time case. Perform Eval 41(4):269–293MATHCrossRefGoogle Scholar
  20. White H, Christie LS (1958) Queueing with preemptive or with breakdown. Oper Res 6:79–95CrossRefMathSciNetGoogle Scholar
  21. Zeephongsekul P, Bedford A (2006) Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline. Eur J Oper Res 172(3):886–908MATHCrossRefMathSciNetGoogle Scholar
  22. Zolotarev VM (1975) On the continuity of stochastic sequences generated by recurrent processes. Theory Probab Appl 20:819–832MATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.LAMOSUniversity of BejaïaBejaïaAlgeria

Personalised recommendations