Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-28T00:59:18.427Z Has data issue: false hasContentIssue false

On the Busy Period of GI/G/1 Queue with Two Priority Levels and Feedbacks

Published online by Cambridge University Press:  01 July 2016

R. B. Haugen*
Affiliation:
Norwegian Telecommunication Administration Research Establishment

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
III. Workshop on Computer System Modelling
Copyright
Copyright © Applied Probability Trust 1978 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Takács, L. (1963) A single server queue with feedback. Bell Syst. Tech. J. 42, 505519.Google Scholar
[2] Chang, W. (1968) Queues with feedback for time-sharing computer systems analysis. Opns Res. 16, 613627.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, 12.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, 13311336.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, 13.Google Scholar
[6] Jaiswal, N. K. (1968) Priority Queues. Academic Press, New York.Google Scholar
[7] Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277289.Google Scholar