Skip to main content
SpringerLink
Log in

Flow time distributions in aK classM/G/1 priority feedback queue

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

In this paper, aK classM/G/1 queueing system with feedback is examined. Each arrival requires at least one, and possibly up toK service phases. A customer is said to be in classk if it is waiting for or receiving itskth phase of service. When a customer finishes its phasek ≤K service, it either leaves the system with probabilityp k, or it instantaneously reenters the system as a classk + 1 customer with probability (1 −p k). It is assumed thatp k = 1. Service is non-preemptive and FCFS within a specified priority ordering of the customer classes. Level crossing analysis of queues and delay cycle results are used to derive the Laplace-Stieltjes Transform (LST) for the PDF of the sojourn time in classes 1,…,k;k ≤K.

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. P.H. Brill, System point theory in exponential queues, Ph.D. Thesis, Department of Industrial Engineering, The University of Toronto, Canada (1975).

    Google Scholar 

  2. P.H. Brill, An embedded level crossing technique for dams and queues, J. Appl. Prob. 16 (1979) 174–186.

    Article  Google Scholar 

  3. P.H. Brill and L. Green, Queues in which customers receive simultaneous service from a random number of servers: a system point approach, Manag. Sci. 30 (1984) 51–68.

    Article  Google Scholar 

  4. P.H. Brill and M.J. Posner, A two server queue with nonwaiting customers receiving specialized service, Manag. Sci. 27 (1981) 914–925.

    Google Scholar 

  5. P.H. Brill and M.J. Posner, Level crossings in point processes applied to queues, Oper. Res. 25 (1977) 662–674.

    Google Scholar 

  6. P.H. Brill and M.J. Posner, The system point method in exponential queues: a level crossing approach, Math. Oper. Res. 6 (1981) 31–49.

    Google Scholar 

  7. J.W. Cohen, On up- and downcrossings, J. Appl. Prob. 14 (1977) 405–410.

    Article  Google Scholar 

  8. J.W. Cohen,The Single Server Queue, North-Holland Series in Applied Mathematics and Mechanics (North-Holland, 1982).

  9. R.M. Conway, W. Maxwell and L. Miller,Theory of Scheduling (Addison-Wesley, 1967).

  10. R. Disney, D. McNickle and B. Simon, TheM/G/1 queue with instantaneous Bernoulli feedback, Naval Res. Logist. Quarterly 27 (1980) 635–644.

    Google Scholar 

  11. E. Jewkes and J.A. Buzacott, A two class priorityM/G/1 queue with feedback, Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada (1988).

    Google Scholar 

  12. L. Kleinrock,Queueing Systems, vols. 1 and 2 (Wiley, 1975).

  13. G.P. Klimov, Time sharing service systems I, Theory Appl. Prob. 19 (1974) 532–551; J. ACM 21 (1974).

    Article  Google Scholar 

  14. P. Nain, P. Tsoucas and J. Walrand, Interchange arguments in stochastic scheduling, Working paper (May 1988).

  15. J.G. Shanthikumar, Some analysis on the control of queues using level crossings of regenerative processes, J. Appl. Prob. 17 (1980) 814–821.

    Article  Google Scholar 

  16. J.G. Shanthikumar, Analysis of the control of queues with shortest processing time service discipline, J. Oper. Res. Soc. Japan 23 (1980) 341–352.

    Google Scholar 

  17. J.G. Shanthikumar, On level crossing analysis of queues, Austral. J. Statist. 23 (1981) 337–342.

    Article  Google Scholar 

  18. J.G. Shanthikumar, On the buffer behaviour with Poisson arrivals, priority service, and random server interruptions, IEEE Trans. Comp. C-30 (1980) 781–786.

    Google Scholar 

  19. J.G. Shanthikumar, Optimal control of anM/G/1 priority queue viaN-control, Amer. J. Math. Manag. Sci. 1 (1981) 191–212.

    Google Scholar 

  20. J.G. Shanthikumar, Level crossing analysis of some variants ofGI/M/1 queues, Opsearch 19 (1982) 148–159.

    Google Scholar 

  21. J.G. Shanthikumar, Analysis of priority queues with server control, Opsearch 21 (1984).

  22. B. Simon, Priority queues with feedback, J. ACM 31 (1984) 134–149.

    Article  Google Scholar 

  23. D. Tcha and S.R. Pliska, Optimal control of single server queueing networks and multi-classM/G/1 queues with feedback, Oper. Res. 25 (1977) 248–258.

    Google Scholar 

  24. P. Varaiya, J. Walrand and C. Buyukkoc, Extensions of the multiarmed bandit problem: the discounted case, IEEE Trans. Automatic Control AC-30 (1985).

  25. P. Whittle, Arm-acquiring bandits, Ann. Prob. 9 (1981) 284–292.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, The University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Elizabeth M. Jewkes & John A. Buzacott

Authors
  1. Elizabeth M. Jewkes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John A. Buzacott
    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

Jewkes, E.M., Buzacott, J.A. Flow time distributions in aK classM/G/1 priority feedback queue. Queueing Syst 8, 183–202 (1991). https://doi.org/10.1007/BF02412249

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02412249

Keywords

Search

Navigation