Analysis of multiclass M/G/1 queues with a mixture of 1-limited disciplines and gated disciplines

Journal of the Operations Research Society of Japan

Volumn 42, Issue 3, 1999, Pages 237-255

  Hirayama, Tetsuji ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033197045     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.42.237     Document Type: Article

References (27)

1. B. Avi-Itzhak and S. Halfin: Response times in gated M/G/1 queues: The processorsharing case. Queueing Systems, 4 (1989) 263-279.
2. J.S.-C. Chen, R. Guérin and T.E. Stern: Markov-modulated flow model for the output queues of a packet switch. IEEE Transactions on Communications, 40 (1992) 1098-1110.
3. J.S.-C. Chen and R. Guérin: Performance study of an input queueing packet switch with two priority classes. IEEE Transactions on Communications, 39 (1991) 117-126.
4. A. Cobham: Priority assignment in waiting line problems. Operations Research, 2 (1954) 70-76.
5. M.J. Ferguson and Y.J. Aminetzah: Exact results for nonsymmetric token ring systems. IEEE Transactions on Communications, 33 (1985) 223-231.
6. T.W. Gay and P.H. Seaman: Composite priority queue. IBM Journal of Research and Development, 19 (1975) 78-81.
7. P.W. Glynn and W. Whitt: Extensions of the queueing relations L = λW and H = λG. Operations Research, 37 (1989) 634-644.
8. Hewlett Packard: Network Design Guide: Designing HP Advance Stack Networks (Hewlett Packard, 1998).
9. T. Hirayama: Mean sojourn times of multiclass feedback queues with gated service disciplines. Abstracts of the 1997 Fall National Conference of ORSJ (Operations Research Society of Japan, 1997), 1-C-3.
10. S.J. Hong, T. Hirayama and K. Yamada: The mean sojourn time of multiclass M/G/1 queues with feedback. Asia-Pacific Journal of Operational Research, 10 (1993) 233-249.
11. N.K. Jaiswal: Priority Queues (Academic Press, New York, 1968).
12. M.J. Karol, M.G. Hluchyj and S.P. Morgan: Input versus output queueing on a space-division packet switch. IEEE Transactions on Communications, 35 (1987) 1347-1356.
13. L. Kleinrock: Queueing Systems Vol. II: Computer Applications (Wiley, New York, 1976).
14. O. Kella and U. Yechiali: Priorities in M/G/1 queue with server vacations. Naval Research Logistics, 35 (1988) 23-34.
15. H. Levy: Binomial-gated service: A method for effective operation and optimization of polling systems. IEEE Transactions on Communications, 39 (1991) 1341-1350.
16. R.G. Miller, Jr.: Priority queues. The Annals of Mathematical Statistics, 31 (1960) 86-103.
17. M. Paterok and M. Ettl: Sojourn time and waiting time distributions for M/GI/1 queues with preemption-distance priorities. Operations Research, 42 (1994) 1146-1161.
18. K.M. Rege and B. Sengupta: A single server queue with gated processor-sharing discipline. Queueing Systems, 4 (1989) 249-261.
19. S.M. Ross: Applied Probability Models with Optimization Applications (Holden-Day, San Francisco, 1970).
20. J.G. Shanthikumar: Level crossing analysis of priority queues and a conservation identity for vacation models. Naval Research Logistics, 36 (1989) 797-806.
21. H. Takagi: Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991).
22. Y. Takahashi and S. Shimogawa: Composite priority single-server queue with structured batch inputs. Commun. Statist.-Stochastic Models, 7 (1991) 481-497.
23. 3 Com: Building multi-gigabit backbones: A new switching architecture for beyond 2000. 3 Com Technical Papers, 500663-001 (1998).
24. W. Whitt: A review of L = λW and extensions. Queueing Systems, 9 (1991) 235-268.
25. W. Whitt: Correction note on L = λW. Queueing Systems, 12 (1992) 431-432.
26. R.W. Wolff: Stochastic Modeling and the Theory of Queues (Prentice-Hall, Englewood Cliffs, NJ, 1989).
27. R.W. Wolff: Poisson arrivals see time averages. Operations Research, 30 (1982) 223-231.