Skip to main content
Log in

Exact tail asymptotics for a discrete-time preemptive priority queue

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

In this paper, we consider a discrete-time preemptive priority queue with different service completion probabilities for two classes of customers, one with high-priority and the other with low-priority. This model corresponds to the classical preemptive priority queueing system with two classes of independent Poisson customers and a single exponential server. Due to the possibility of customers’ arriving and departing at the same time in a discrete-time queue, the model considered in this paper is more complicated than the continuous-time model. In this model, we focus on the characterization of the exact tail asymptotics for the joint stationary distribution of the queue length of the two types of customers, for the two boundary distributions and for the two marginal distributions, respectively. By using generating functions and the kernel method, we get the exact tail asymptotic properties along the direction of the low-priority queue, as well as along the direction of the high-priority queue.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alfa A S. Matrix-geometric solution of discrete time MAP/PH/1 priority queue. Nav. Res. Logist., 45: 23–50 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alfa A S, Liu B, He Q M. Discrete-time analysis of MAP/PH/1 multiclass general preemptive priority queue. Nav. Res. Logist., 50: 662–682 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bender E. Asymptotic methods in enumeration. SIAM Review, 16: 485–513 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  4. Drekic S, Woolford D G. A preemptive priority queue with balking. Eur. J. Oper. Res., 164: 387–401 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fayolle G, Iasnogorodski R, Malyshev V. Random Walks in the Quarter-Plane. Springer-Verlag, New York, 1999

    Book  MATH  Google Scholar 

  6. Flajolet F, Sedgewick R. Analytic Combinatorics. Cambridge University Press, Cambridge, 2009

    Book  MATH  Google Scholar 

  7. Gail H R, Hantler S L, Taylor B A. Analysis of a non-preemptive priority multiserver queue. Appl. Probab., 20: 852–879 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gail H R, Hantler S L, Taylor B A. On preemptive Markovian queue with multiple servers and two priority classes. Math. Oper. Res., 17: 365–391 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hunter J J. Mathematical Techniques of Applied Probability, Volume 2, Discrete Time Models: Techniques and Applications. Academic Press, New York, 1983

    MATH  Google Scholar 

  10. Isotupa K P S, Stanford D A. An infinite-phase quasi-birth-and-death model for the non-preemptive priority M/PH/1 queue. Stoch. Models, 18: 378–410 (2002)

    MathSciNet  Google Scholar 

  11. Kao E P S, Narayanan K S. Computing steady-state probabilities of a non-preemptive priority multiserver queue. ORSA J. Comput., 2: 211–218 (1990)

    Article  MATH  Google Scholar 

  12. Li H, Zhao Y Q. Exact tail asymptotics in a priority queue-characterizations of the preemptive model. Queueing Syst., 63: 355–381 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Li H, Zhao Y Q. Tail asymptotics for a generalized two-demand queueing model-a kernel method. Queueing Syst., 69: 77–100 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  14. Li H, Tavakoli J, Zhao Y Q. Analysis of exact tail asymptotics for singular random walks in the quarter plane. Queueing Syst., 74: 151–179 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Miller D R. Computation of steady-state probabilites for M/M/1 priority queues. Oper. Res., 29: 945–958 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  16. Takine T. A nonpreemptive priority MAP/G/1 queue with two classes of customers. J. Oper. Res. Soc. Jpn., 39: 266–290 (1996)

    MATH  MathSciNet  Google Scholar 

  17. Xue J, Alfa A S. Tail probability of low-priority queue length in a discrete-time priority BMAP/PH/1 queue. Stoch. Models, 21: 799–820 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Xu C. Tail Asymptotics for a Discrete-Time Priority Preemptive Queueing System. Master Thesis, Carleton University, 2010

    Google Scholar 

  19. Zhao J A, Li B, Cao X R, Ahmad I. A matrix-analytic solution for the DBMAP/PH/1 priority queue, Queueing Syst., 53: 127–145 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong-shuai Dai.

Additional information

Supported in part by the National Natural Science Foundation of China under Grant No. 11271373 and 11361007, and the Guangxi Natural Science Foundation under Grant No. 2014GXNSFCA118001 and 2012GXNSFBA053010.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, Y., Liu, Zm. & Dai, Hs. Exact tail asymptotics for a discrete-time preemptive priority queue. Acta Math. Appl. Sin. Engl. Ser. 31, 43–58 (2015). https://doi.org/10.1007/s10255-015-0448-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-015-0448-6

Keywords

2000 MR Subject Classification

Navigation