Skip to main content
SpringerLink
Log in

Approximation in the M 2/G 2/1 Queue with Preemptive Priority

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

The main purpose of this paper is to use the strong stability method to approximate the characteristics of the M 2/G 2/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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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–5

    Google Scholar 

  • Alfa AS (2009) Matrix-geometric solution of discrete time MAP/PH/1 priority queue. Nav Res Logist 45(1):23–50

    Article  MathSciNet  Google Scholar 

  • Anisimov VV (1988) Estimates for the deviations of the transition characteristics of non-homogeneous Markov processes. Ukr Math J 40:588–592

    Article  MathSciNet  Google Scholar 

  • Anisimov VV (2008) Swiching processes in queueing models. Wiley, New York

    Book  Google Scholar 

  • Cho GE, Meyer CD (2001) Comparison of perturbation bounds for the stationary distribution of a Markov chain. Linear Algebra Appl 335:137–150

    Article  MATH  MathSciNet  Google Scholar 

  • 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–782

    Article  MATH  MathSciNet  Google Scholar 

  • Heidergott B, Hordijk A (2003) Taylor series expansions for stationary Markov chains. Adv Appl Prob 35:1046–1070

    Article  MATH  MathSciNet  Google Scholar 

  • Heidergott B, Hordijk A, Van Uitert M (2007) Series expansions for finite-state Markov chains. Probab Eng Inf Sci 21:381–400

    Article  MATH  Google Scholar 

  • Jaiswal NK (1961) Preemptive resume priority queue. Oper Res 6:732–742

    Article  MathSciNet  Google Scholar 

  • Kartashov NV (1996) Strong stable Markov chains. VSP, Utrech

    MATH  Google Scholar 

  • Katayama T, Kobayashi K (2007) Analysis of a nonpreemptive priority queue with exponential timer and server vacations. Perform Eval 64(6):495–506

    Article  Google Scholar 

  • Kirkland S (2002) On a question concerning condition numbers for Markov chain. SIAM J Matrix Anal Appl 23:1109–1119

    Article  MATH  MathSciNet  Google Scholar 

  • Liu Z, Wu J (2009) An MAP/G/1 G-queues with preemptive resume and multiple vacations. Appl Math Model 33(3):1739–1748

    Article  MATH  MathSciNet  Google Scholar 

  • Mitrophanov AY (2005) Sensitivity and convergence of uniformly ergodic Markov chains. J Appl Probab 42:1003–1014

    Article  MATH  MathSciNet  Google Scholar 

  • Neumann M, Xu J (2003) Improved bounds for a condition number of Markov chains. Linear Algebra Appl 386:225–241

    Article  MathSciNet  Google Scholar 

  • Rupert G, Miller J (1960) Priority queues. Ann Math Stat 31(1):86–103

    Article  MATH  Google Scholar 

  • Rachev ST (1989) The problem of stability in queueing theory. Queueing Syst 4:287–318

    Article  MATH  MathSciNet  Google Scholar 

  • Stoyan D, Daley DJ (1984) Comparison methods for queues and other stochastic models. Wiley, New York

    Google Scholar 

  • 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–293

    Article  MATH  Google Scholar 

  • White H, Christie LS (1958) Queueing with preemptive or with breakdown. Oper Res 6:79–95

    Article  MathSciNet  Google Scholar 

  • 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–908

    Article  MATH  MathSciNet  Google Scholar 

  • Zolotarev VM (1975) On the continuity of stochastic sequences generated by recurrent processes. Theory Probab Appl 20:819–832

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMOS, University of Bejaïa, Targua Ouzemour, Bejaïa, 06000, Algeria

    Naima Hamadouche & Djamil Aïssani

Authors
  1. Naima Hamadouche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Djamil Aïssani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naima Hamadouche.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamadouche, N., Aïssani, D. Approximation in the M 2/G 2/1 Queue with Preemptive Priority. Methodol Comput Appl Probab 13, 563–581 (2011). https://doi.org/10.1007/s11009-010-9175-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-010-9175-x

Keywords

AMS 2000 Subject Classification

Search

Navigation