A review of L=&lgr;W and extensions
Queueing Systems: Theory and Applications
Ballot theorems applied to the transient analysis of nD/D/1 queues
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
On the Exact Analysis of a Discrete-Time Queueing System with Autoregressive Inputs
Queueing Systems: Theory and Applications
Analysis, Design, and Control of Queueing Systems
Operations Research
Discrete-time multiserver queues with geometric service times
Computers and Operations Research
OR FORUM---Little's Law as Viewed on Its 50th Anniversary
Operations Research
The analysis of a multiserver queue fed by a discrete autoregressive process of order 1
Operations Research Letters
| Hi-index | 0.00 |
We consider a discrete-time queueing system where the arrival process is general and each arriving customer brings in a constant amount of work which is processed at a deterministic rate. We carry out a sample-path analysis to derive an exact relation between the set of system size values and the set of waiting time values over a busy period of a given sample path. This sample-path relation is then applied to a discrete-time $$G/D/c$$ queue with constant service times of one slot, yielding a sample-path version of the steady-state distributional relation between system size and waiting time as derived earlier in the literature. The sample-path analysis of the discrete-time system is further extended to the continuous-time counterpart, resulting in a similar sample-path relation in continuous time.