Skip to main content
SpringerLink
Log in

Interdeparture time distributions in ΣiMi/Gi/1 priority queues

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper reviews existing results for the stationary interdeparture time distribution in the M/G/1 nonpreemptive and preemptive resume queues, and introduces a unified approach which exploits for the first time the common structure for the interdeparture time process that is present in all classical preemptive priority service disciplines. This approach confirms previously known results for the preemptive resume discipline, and presents new results for several variants of the preemptive repeat model. Exact expressions for the squared coefficient of variation of the interdeparture time distribution are also provided. Several numerical examples are given and discussed.

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

  1. N.T.J. Bailey, The Mathematical Theory of Infectious Disease and Its Applications (Charles Griffin, London, 1975).

    Google Scholar 

  2. G.R. Bitran and D. Tirupati, Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference, Managm.Sci. 34 (1988) 75–100.

    Google Scholar 

  3. A.B. Bondi and Y.-M. Chuang, A new MVA-based approximation for closed queueing networks with a preemptive priority server, Performance Evaluation 8 (1988) 195–221.

    Article  Google Scholar 

  4. O.J. Boxma and R. Syski, eds., Queueing Theory and Its Applications: Liber Amicorum for J.W.Cohen (North-Holland, Amsterdam, 1988).

    Google Scholar 

  5. R.M. Bryant, A.E. Krzesinski, M.S. Lakshmi and K.M. Chandy, The MVA priority approximation, ACM Trans.Comput.Systems 2 (1984) 335–359.

    Article  Google Scholar 

  6. P.J. Burke, The output of a queueing system, Oper.Res. 4 (1956) 699–704.

    Google Scholar 

  7. W. Chang, Preemptive priority queues, Oper.Res. 13 (1965) 820–827.

    Google Scholar 

  8. R.W. Conway, W. Maxwell and L. Miller, Theory of Scheduling (Addison-Wesley, Reading, MA, 1967).

    Google Scholar 

  9. L.Delbrouck, personal communication (1985).

  10. L. Delbrouck, Interdeparture times in M/G/1 queueing systems with nonpreemptive priority discipline, Oper.Res.Lett. 9 (1990) 65–69.

    Article  Google Scholar 

  11. S. Drekic and D.A. Stanford, Preemptive repeat priority queues with changing service distributions, Technical Report #96-05, Department of Statistical and Actuarial Sciences, The University of Western Ontario, London, Ontario (1996).

    Google Scholar 

  12. K.W. Fendick, V.R. Saksena and W. Whitt, Dependence in packet queues, IEEE Trans.Commun. 37 (1989) 1173–1183.

    Article  Google Scholar 

  13. K.W. Fendick, V.R. Saksena and W. Whitt, Investigating dependence in packet queues with the index of dispersion for work, IEEE Trans.Commun. 39 (1991) 1231–1244.

    Article  Google Scholar 

  14. W. Fischer and D.A. Stanford, Approximations for the per-class waiting time and the interdeparture time in the ∑ i GI i /GI i /1 queue, Performance Evaluation 14 (1992) 65–78.

    Article  Google Scholar 

  15. E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems (Academic Press, London, 1980).

    Google Scholar 

  16. Q.-M. He and D.A. Stanford, Distributions of the interdeparture times in MMAP(2)/G(2)/1 queues, Performance Evaluation 38 (1999) 85–103.

    Article  Google Scholar 

  17. N.K. Jaiswal, Priority Queues (Academic Press, New York, 1968).

    Google Scholar 

  18. J.S. Kaufman, Approximation methods for networks of queues with priorities, Performance Evaluation 4 (1984) 183–198.

    Article  Google Scholar 

  19. L. Kleinrock, Queueing Systems, Vol.II: Computer Applications (Wiley, New York, 1976).

    Google Scholar 

  20. P.J. Kühn, Approximate analysis of general queueing networks by decomposition, IEEE Trans.Commun. 27 (1979) 113–126.

    Article  Google Scholar 

  21. S.S. Lavenberg, ed., Computer Performance Modeling Handbook (Academic Press, New York, 1983).

  22. R. Marie and K.S. Trivedi, A note on the effect of preemptive policies on the stability of a priority queue, Inform.Process.Lett. 24 (1987) 397–401.

    Article  Google Scholar 

  23. K.T. Marshall, Some inequalities in queueing, Oper.Res. 16 (1968) 651–665.

    Google Scholar 

  24. R.J.T. Morris, Priority queueing networks, Bell System Tech.J. 60 (1981) 1745–1769.

    Google Scholar 

  25. P. Nain, Interdeparture times from a queueing system with preemptive resume priority, Performance Evaluation 4 (1984) 93–98.

    Article  Google Scholar 

  26. W.P. Pierskalla and D.J. Brailer, Applications of operations research in health care delivery, in: Operations Research and the Public Sector, eds.S.M. Pollock, M.H. Rothkopf and A. Barnett (North-Holland, Amsterdam, 1994) pp.469–505.

    Google Scholar 

  27. H. Saito, Interdeparture times from an M/G/1 queue with heterogeneous inputs, in: Proc.of Spring National Conf.of ORSJ, Matsuyama, Japan (1989).

    Google Scholar 

  28. W. Schmitt, Approximate analysis of Markovian queueing networks with priorities, in: Congressbook for the ITC-10, Montreal, PQ (1983) paper 1.3-3.

  29. M. Segal and W. Whitt, A queueing network analyser for manufacturing, in: Teletraffic Science for New Cost-Effective Systems, Networks and Services, ITC-12, ed.M. Bonatti (Elsevier Science, Amsterdam, 1989) pp.1146–1152.

    Google Scholar 

  30. K.C. Sevcik, Priority scheduling disciplines in queueing network models of computer systems, in: Proc.of the IFIP Congress 77, ed.B. Gilchrist (North-Holland, Amsterdam, 1977) pp.565–570.

    Google Scholar 

  31. J.G. Shantikumar and J.A. Buzacott, Open queueing network models of dynamic job shops, Internat.J.Product Res. 19 (1981) 255–266.

    Google Scholar 

  32. D.A. Stanford and W. Fischer, The interdeparture time distribution for each class in the ∑ i M i /G i /1 queue, Queueing Systems 4 (1989) 177–191.

    Article  Google Scholar 

  33. D.A. Stanford, Interdeparture-time distributions in the nonpreemptive priority ∑ i M i /G i /1 queue, Performance Evaluation 12 (1991) 43–60.

    Article  Google Scholar 

  34. D.A. Stanford and W. Fischer, Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals, Stochastic Models 7 (1991) 311–320.

    Google Scholar 

  35. D.A. Stanford, Waiting and interdeparture times in priority queues with Poisson-and general-arrival streams, Oper.Res. 45 (1997) 725–735.

    Google Scholar 

  36. B.W. Stuck and E. Arthurs, A Computer and Communications Network Performance Analysis Primer (Prentice-Hall, Englewood Cliffs, NJ, 1985).

    Google Scholar 

  37. S. Suresh and W. Whitt, The heavy-traffic bottleneck phenomenon in open queueing networks, Oper.Res.Lett. 9 (1990) 355–362.

    Article  Google Scholar 

  38. L. Takács, Introduction to the Theory of Queues (Oxford Univ.Press, Oxford, 1962).

    Google Scholar 

  39. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol.1: Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991).

    Google Scholar 

  40. J.B.M. Van Doremalen, J. Wessels and R. Wijbrands, Approximate analysis of priority queueing networks, in: Teletraffic Analysis and Computer Performance Evaluation, eds.O.J. Boxma, J.W. Cohen and H.C. Tijms (North-Holland, Amsterdam, 1986) pp.117–131.

    Google Scholar 

  41. P.D. Welch, On pre-emptive resume priority queues, Ann.Math.Statist. 35 (1964) 600–612.

    Google Scholar 

  42. W. Whitt, The queueing network analyzer, Bell System Tech.J. 62(9) (1983) 2779–2815.

    Google Scholar 

  43. W. Whitt, Approximations for single-class departure processes from multi-class queues, AT & T Bell Laboratories, Murray Hill, NJ (1987).

    Google Scholar 

  44. W. Whitt, A light-traffic approximation for single-class departure processes from multi-class queues, Managm.Sci. 34 (1988) 1333–1346.

    Article  Google Scholar 

  45. W. Whitt, Large fluctuations in a deterministic multiclass network of queues, Managm.Sci. 39 (1993) 1020–1028.

    Google Scholar 

  46. W. Whitt, Towards better multi-class parametric-decomposition approximations for open queueing networks, Ann.Oper.Res. 48 (1994) 221–248.

    Article  Google Scholar 

Download references

Authors
  1. David A. Stanford
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steve Drekic
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stanford, D.A., Drekic, S. Interdeparture time distributions in ΣiMi/Gi/1 priority queues. Queueing Systems 36, 1–21 (2000). https://doi.org/10.1023/A:1019118800516

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019118800516

Search

Navigation