No CrossRef data available.
Article contents
On the Busy Period of GI/G/1 Queue with Two Priority Levels and Feedbacks
Published online by Cambridge University Press: 01 July 2016
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- III. Workshop on Computer System Modelling
- Information
- Copyright
- Copyright © Applied Probability Trust 1978
References
[1]
Takács, L. (1963) A single server queue with feedback. Bell Syst. Tech. J.
42, 505–519.Google Scholar
[2]
Chang, W. (1968) Queues with feedback for time-sharing computer systems analysis. Opns Res.
16, 613–627.Google Scholar
[3]
Enns, E. G. (1970) A simple method of calculating queue size distributions of priority queues with feedback. Proc. ITC VI, Munich 1970, 314, 1–2.Google Scholar
[4]
Chan, W. C., Chung, W. K. and Maa, D. Y. (1973) Multiserver computer controlled queueing system with pre-emptive priorities and feedback. Proc. IEE
120, 1331–1336.Google Scholar
[5]
Enns, E. G. and Wignall, T. K. (1973) The busy period and the probability that a particular queue is in service in a single server queueing system with N queues, arbitrary priorities and a general probabilistic inter-queue transition matrix. Proc. ITC VII, Stockholm 1973, 438, 1–3.Google Scholar
[7]
Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc.
48, 277–289.Google Scholar