Some analyses on the control of queues using level crossings of regenerative processes
- 1 March 1980
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 17 (03) , 814-821
- https://doi.org/10.1017/s002190020003391x
Abstract
Some properties of the number of up- and downcrossings over level u, in a special case of regenerative processes are discussed. Two basic relations between the density functions and the expected number of upcrossings of this process are derived. Using these reults, two examples of controlled M/G/1 queueing systems are solved. Simple relations are derived for the waiting time distribution conditioned on the phase of control encountered by an arriving customer. The Laplace-Stieltjes transform of the distribution function of the waiting time of an arbitrary customer is also derived for each of these two examples.Keywords
This publication has 5 references indexed in Scilit:
- Level Crossings in Point Processes Applied to Queues: Single-Server CaseOperations Research, 1977
- On up- and downcrossingsJournal of Applied Probability, 1977
- Utilization of Idle Time in an M/G/1 Queueing SystemManagement Science, 1975
- Regenerative processes in the theory of queues, with applications to the alternating-priority queueAdvances in Applied Probability, 1972
- Optimal Operating Policies for M/G/1 Queuing SystemsOperations Research, 1968