For the sample functions of the stationary virtual waiting-time process v, of the GI/G/1 queueing system some properties of the number of up- and downcrossings of level v by the v,-process during a busy cycle are investigated. It turns out that the simple fact that this number of upcrossings is equal to that of downcrossings leads in a rather easy way to basic relations for the waiting-time distributions. This approach to the study of the v,-process of the GI G /1 system seems to be applicable to many other types of stochastic processes. As another example of this approach the infinite dam with non-constant release rate is briefly discussed.
[1]
Jacob Cohen,et al.
On regenerative processes in queueing theory
,
1976
.
[2]
L. Takács.
THE LIMITING DISTRIBUTION OF THE VIRTUAL WAITING TIME AND THE QUEUE SIZE FOR A SINGLE-SERVER QUEUE WITH RECURRENT INPUT AND GENERAL SERVICE TIMES
,
1963
.
[3]
G. F. Newell,et al.
Introduction to the Theory of Queues.
,
1963
.
[4]
Vincent Hodgson,et al.
The Single Server Queue.
,
1972
.
[5]
E. Çinlar,et al.
On dams with additive inputs and a general release rule
,
1972,
Journal of Applied Probability.