Answers are grounded in this paper and cite their sources.
We study a single server queueing system with general service time distribution and memoryless inter-arrival times. The arrival rate is not constant but varies with the number of customers in the system. A recursive formula for the conditional distribution of the remaining service time given the queue length is derived for an arbitrary epoch. It is also shown that this conditional distribution holds for arrival epochs. The recursion for the corresponding Laplace–Stieltjes transforms and expected values is given in a simple formula.
No takes yet. Share an insight, caveat, or question.
Yoav Kerner (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: