Generalised Pollaczek–Khinchin formula for the Polya/G/1 queue
ST Mirtchev, I Ganchev - Electronics Letters, 2017 - Wiley Online Library
Electronics Letters, 2017•Wiley Online Library
A generalised Pollaczek–Khinchin formula for the Polya/G/1 queue, with a Polya peaked
arrival process, general distributed service times, and infinite number of waiting positions, is
obtained. It is shown that the peakedness of the number of arrivals and the variance of the
service time lead to a significant increase in the service delay and queue length.
arrival process, general distributed service times, and infinite number of waiting positions, is
obtained. It is shown that the peakedness of the number of arrivals and the variance of the
service time lead to a significant increase in the service delay and queue length.
A generalised Pollaczek–Khinchin formula for the Polya/G/1 queue, with a Polya peaked arrival process, general distributed service times, and infinite number of waiting positions, is obtained. It is shown that the peakedness of the number of arrivals and the variance of the service time lead to a significant increase in the service delay and queue length.
Wiley Online Library