Open queueing systems in light traffic
Mathematics of Operations Research
A simple relationship between light and heavy traffic limits
Operations Research - Supplement to Operations Research: stochastic processes
Statistical multiplexing of VBR sources: a matrix-analytic approach
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
Packet delay and queue length for statistical multiplexers with low-speed access lines
Computer Networks and ISDN Systems
The complete analysis of the discrete time finite DBMAP/G/1/N queue
Performance Evaluation
Heavy traffic limits associated with M/G/∞ input processes
Queueing Systems: Theory and Applications
On the Exact Analysis of a Discrete-Time Queueing System with Autoregressive Inputs
Queueing Systems: Theory and Applications
The discrete-time queue with autoregressive inputs revisited
Queueing Systems: Theory and Applications
Discrete-time buffer systems with session-based arrival streams
Performance Evaluation
| Hi-index | 0.00 |
We assess the performance of a discrete-time queueing system with train arrivals. Arrivals at the queue stem from a number of active sessions, each generating a packet in a slot with fixed probability q. Since an exact analysis is not feasible for q ≠ 1, we rely on Taylor-series expansions around q = 0 of the joint probability generating functions of the number of active sessions and the queue content. These expansions are then either combined with the known generating function for q = 1 if the system is stable for q = 1, or with heavy-traffic results if this is not the case. In both cases, we obtain expressions for the moments of queue content and packet delay and assess the accuracy of our approximations by means of simulation.