A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution
Performance Evaluation
Waiting time, busy periods and output models of a server analyzed via Wiener-Hopf factorization
Performance Evaluation - Special issue on performance and control of network systems
Computing waiting-time probabilities in the discrete-time queue: GIX/G/1
Performance Evaluation
Combined Elapsed Time and Matrix-Analytic Method for the Discrete Time GI/G/1 and GIX/G/1 Systems
Queueing Systems: Theory and Applications
Decomposition of an M/D/r·k queue with FIFO into k Ek/D/r queues with FIFO
Operations Research Letters
On the variances of system size and sojourn time in a discrete-time dar(1)/d/1 queue
Probability in the Engineering and Informational Sciences
| Hi-index | 0.00 |
In this paper, we first establish a discrete-time version of what is called the distributional Little's law, a relation between the stationary distributions of the number of customers in a system (or queue length) and the number of slots a customer spends in that system (or waiting time). Based on this relation, we then present a simple computational procedure to obtain the queue-length distribution of the discrete-time GI/G/1 queue from its waiting-time distribution, which is readily available by various existing methods. Using the same procedure, we also obtain the queue-length distribution of the discrete-time multi-server GI/D/c queue in a unified manner. Sample numerical examples are also given.