Characterisation of the output process of a discrete-time GI/D/1 queue, and its application to network performance
From MaRDI portal
Publication:2014666
Recommendations
Cites work
- scientific article; zbMATH DE number 444952 (Why is no real title available?)
- Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues
- Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
- Exponential approximation of waiting time and queue size for queues in heavy traffic
- Heavy-Traffic Limits for Queues with Many Exponential Servers
- Logarithmic asymptotics for the \(GI /G/1\)-type Markov chains and their applications to the \(BMAP /G/1\) queue with vacations
- On the Exponential Decay Rate of the Tail of a Discrete Probability Distribution
- Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue
- Queueing output processes
- Subexponential asymptotics of the stationary distributions of M/G/1-type Markov chains
- Tail decay rates in double QBD processes and related reflected random walks
- The asymptotic variance of departures in critically loaded queues
- The asymptotic variance rate of the output process of finite capacity birth-death queues
- The burst factor and its impact on buffer performance
- The variance of departure processes: puzzling behavior and open problems
This page was built for publication: Characterisation of the output process of a discrete-time \(GI/D/1\) queue, and its application to network performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014666)