Abstract
In this paper mathematical methods are given for finding the distributions of the virtual waiting time and the occupation time for single-server queues in which the interarrival times and the service times are discrete random variables taking on positive or non-negative integral values. First we shall consider deterministic queues in which the interarrival times and the service times are numerical (non-random) quantities and deduce a fundamental relation for such queues. Then we shall consider random queues with recurrent input and general service times and study the time dependent behavior of such queues.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
