This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The  vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...

This paper proposes a new discrete-time queue analytical model based on BLUE algorithm in order to determine the network congestion in preliminary stages. We compare the original BLUE, which has been implemented in Java, with our proposed analytical model with regards to different performance measures (average queue length, throughput, average queueing delay and packet loss probability). The co...

An analytic a priori error bound is provided for comparing performance measures of discrete time queues with those of a processor sharing queue for which steady state results can be easily obtained. The error bound is of the same order as the length of the discrete time slot. This bound is applied to derive error bounds for performance measures of a time-sharing queue approximated by a processo...