A distributional form of Little's law
From MaRDI portal
Publication:1113549
DOI10.1016/0167-6377(88)90035-1zbMath0662.60104OpenAlexW4214879293WikidataQ55969779 ScholiaQ55969779MaRDI QIDQ1113549
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/5305
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (28)
Little laws for utility processes and waiting times in queues ⋮ The distributional form of Little's law and the Fuhrmann-Cooper decomposition ⋮ Queueing with redundant requests: exact analysis ⋮ A single server queueing system with two phases of service subject to server breakdown and Bernoulli vacation ⋮ A distributional form of Little's law ⋮ The analysis of batch sojourn-times in polling systems ⋮ \(\mathrm{M}/\mathrm{M}/1\) queue with \(m\) kinds of differentiated working vacations ⋮ Analysis and optimisation of a \(M/M/1/WV\) queue with Bernoulli schedule vacation interruption and customer's impatience ⋮ A product form solution to a system with multi-type jobs and multi-type servers ⋮ Batch arrival single-server queue with variable service speed and setup time ⋮ Performance analysis of a Markovian queue with impatient customers and working vacation ⋮ Delay performance of data-center queue with setup policy and abandonment ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward ⋮ Stochastic decompositions in the \(M/M/1\) queue with working vacations ⋮ The \(M/G/1/K\) blocking formula and its generalizations to state-dependent vacation systems and priority systems ⋮ A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues ⋮ The analysis of the M/M/1 queue with two vacation policies (M/M/1/SWV+MV) ⋮ THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS ⋮ A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application ⋮ Queues with random back-offs ⋮ A Palm calculus approach to functional versions of Little's law ⋮ A polling model with an autonomous server ⋮ Service with a queue and a random capacity cart: random processing batches and E-limited policies ⋮ A review of \(L=\lambda W\) and extensions ⋮ An \(M/G/1\) queue with Markov-dependent exceptional service times ⋮ Stochastic non-bipartite matching models and order-independent loss queues
Cites Work
- Unnamed Item
- A distributional form of Little's law
- A Survey of J. Little's Formula
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules
- An N-Server Cutoff Priority Queue
- State Dependence in M/G/1 Server-Vacation Models
- Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules
- The preempt-resume M/G/1 queue with feedback and clocked schedules
- A Proof for the Queuing Formula: L = λW
- Conservation Equations and Variance Reduction in Queueing Simulations
- Poisson Arrivals See Time Averages
- Efficient Estimators for Simulated Queueing Systems
- Optimal Operating Policies for M/G/1 Queuing Systems
- Families of Infinitely Divisible Distributions Closed Under Mixing and Convolution
This page was built for publication: A distributional form of Little's law
