A distributional form of Little's law in heavy traffic
Consider a system of single-server queues indexed by the traffic intensity \(\rho<1\), and let \(l(\rho)\), \(w(\rho)\) denote the queue length, resp. the waiting time in the steady state. The input is assumed to have a general form, stationary or nearly stationary in the sense of time averages. It is shown that \[ \sqrt{1-\rho}(l(\rho)-\lambda_ \rho w(\rho))\to_{\mathcal D}bN\sqrt M,\quad\rho\uparrow 1, \] where \(\lambda_ \rho\) is the arrival rate, \(b\) a constant, and \(N\) and \(M\) independent random variables such that \(N\) is standard normal and \(M\) standard exponential.
- Improved bounds for queues with delayed arrivals
- An analog of Little's formula for queueing systems with nonhomogeneous tasks
- Relating the waiting time in a heavy-traffic queueing system to the queue length
- Little laws for utility processes and waiting times in queues
- Marcinkiewicz-type law of large numbers for fuzzy random variables
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Density classification quality of the traffic-majority rules
- Traffic velocity distributions for different spacings
- A theory of traffic congestion at heavy bottlenecks
- scientific article; zbMATH DE number 3986348 (Why is no real title available?)
- Stationary representation of queues. II
- scientific article; zbMATH DE number 3894234 (Why is no real title available?)
- scientific article; zbMATH DE number 3316606 (Why is no real title available?)
- The Poisson Tendency in Traffic Distribution
This page was built for publication: A distributional form of Little's law in heavy traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196940)
