A relation between stationary queue and waiting time distributions
From MaRDI portal
Cited in
(24)- Some explicit formulas for mixed exponential service systems
- Diffusion approximation for multiprogrammed computer systems
- Little laws for utility processes and waiting times in queues
- Approximations for multi-server queues: System interpolations
- Sampling at subexponential times, with queueing applications
- A Palm calculus approach to functional versions of Little's law
- Stationary queuing systems with dependencies
- Log-convexity of counting processes evaluated at a random end of observation time with applications to queueing models
- Packet reordering in networks with heavy-tailed delays
- An approximation manpower planning model for after-sales field service support
- Preservation properties of a renewal process stopped at a random dependent time
- The DFR Property for Counting Processes Stopped at an Independent Random Time
- Steady-state analysis of a multiserver queue in the Halfin-Whitt regime
- A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
- The queue length in an M/G/1 batch arrival retrial queue
- Response times in M/M/s fork-join networks
- THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS
- Preservation of reliability classes associated with the mean residual life by a renewal process stopped at a random time
- Heavy-traffic limits for nearly deterministic queues: Stationary distributions
- Extreme values for the waiting time in large fork-join queues
- A review of L= W and extensions
- Dynamic priority allocation via restless bandit marginal productivity indices
- The impact of production time variability on make-to-stock queue performance
- Tail asymptotics for discrete event systems
This page was built for publication: A relation between stationary queue and waiting time distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5644887)