Occupation Time Problems in the Theory of Queues
Abstract
The author considers a single-server queue and deals with the problem of finding the distribution of the total occupation time of the server in the time interval (0, t) and the distribution of the number of services among the first n services that are not preceded by an idle period. The author also points out the use of the results in the theory of dams.

