Mean sojourn times in multiclass feedback queues with gated disciplines

Naval Research Logistics

Volumn 50, Issue 7, 2003, Pages 719-741

  Hirayama, Tetsuji ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Gated disciplines; Multiclass feedback queues; Multilevel scheduling algorithms

Indexed keywords

ALGORITHMS; LINEAR EQUATIONS; MARKOV PROCESSES; POISSON EQUATION; PROBABILITY; SCHEDULING;

GATED DISCIPLINES; MEAN SOJOURN TIMES; MULTICLASS FEEDBACK QUEUES; MULTILEVEL SCHEDULING ALGORITHMS;

QUEUEING THEORY;

EID: 0141974118     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10086     Document Type: Article

References (21)

1. J.N. Daigle and C.E. Houstis, Analysis of a task oriented multipriority queueing system, IEEE Trans Commun COM-29 (1981), 1669-1677.
2. R.L. Disney, A note on sojourn times in M/G/1 queues with instantaneous, Bernoulli feedback, Naval Res Logist Quart 28 (1981), 679-684.
3. B.T. Doshi and J.S. Kaufman, "Sojourn time in an M/G/1 queue with Bernoulli feedback," Queueing theory and its applications, O.J. Boxma and R. Syski (Editors), Elsevier, North-Holland, Amsterdam, 1988, pp. 207-233.
4. D.H.J. Epema, Mean waiting times in a general feedback queue with priorities, Performance Eval 13 (1991), 45-58.
5. P.W. Glynn and W. Whitt, Extensions of the queueing relations L = λW and H = λG, Oper Res 37 (1989), 634-644.
6. T. Hirayama, Analysis of multiclass M/G/1 queues with a mixture of 1-limited disciplines and gated disciplines, J Oper Res Soc Japan 42 (1999), 237-255.
7. T. Hirayama, A multiclass polling system with feedback, Proc IASTED Int Conf NPDPA 2002, Tsukuba, Japan, 2002, pp. 154-159.
8. E.M. Jewkes and J.A. Buzacott, Flow time distributions in a K class M/G/1 priority feedback queue, Queueing Syst Theory Appl 8 (1991), 183-202.
9. H. Kameda, Foundations of operating systems, Shōkōdō, Tokyo, 1990 (in Japanese).
10. L. Kleinrock, Queueing systems, Vol. II: Computer applications, Wiley, New York, 1976.
11. B. Melamed and W. Whitt, On arrivals that see time averages: A martingale approach, J Appl Probab 27 (1990), 376-384.
12. M. Paterok and O. Fischer, Feedback queues with preemption-distance priorities, Performance Eval Rev 17 (1989), 136-145.
13. M. Sidi, H. Levy, and S.W. Fuhrmann, A queueing network with a single cyclically roving server, Queueing Syst Theory Appl 11 (1992), 121-144.
14. B. Simon, Priority queues with feedback, J ACM 31 (1984), 134-149.
15. H. Takagi, Queueing analysis: A foundation of performance evaluation, Vol. 1: Vacation and priority systems, Part 1, Elsevier, North-Holland, Amsterdam, 1991.
16. H. Takagi, "Queueing analysis of polling models: Progress in 1990-1994," Frontiers in queueing: Models and applications in science and engineering, J.H. Dshalalow (Editor), CRC Press, Boca Raton, FL, 1997, pp. 119-146.
17. A.S. Tanenbaum, Modern operating systems, 2nd edition, Prentice-Hall, Upper Saddle River, NJ, 2001.
18. J.L. van den Berg, O.J. Boxma, and W.P. Groenendijk, Sojourn times in the M/G/1 queue with deterministic feedback, Commun Stat Stochastic Models 5 (1989), 115-129.
19. W. Whitt, A review of L = λW and extensions, Queueing Syst Theory Appl 9 (1991), 235-268.
20. R.W. Wolff, Poisson arrivals see time averages, Oper Res 30 (1982), 223-231.
21. R.W. Wolff, Stochastic modeling and the theory of queues, Prentice-Hall, Englewood Cliffs, NJ, 1989.