A review of \(L=\lambda W\) and extensions
From MaRDI portal
Publication:803674
DOI10.1007/BF01158466zbMath0727.60112MaRDI QIDQ803674
Publication date: 1991
Published in: Queueing Systems (Search for Journal in Brave)
Related Items
ON THE VARIANCES OF SYSTEM SIZE AND SOJOURN TIME IN A DISCRETE-TIME DAR(1)/D/1 QUEUE, Sample path analysis of contribution and reward in cooperative groups, Relating the waiting time in a heavy-traffic queueing system to the queue length, Palm calculus for a process with a stationary random measure and its applications to fluid queues, Little laws for utility processes and waiting times in queues, Waiting time estimation in a manufacturing system using the number of machine idle periods, An examination of some factory physics principles, Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems, Performance measures of nonstationary inventory models for perishable products under the EWA policy, A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws, Controlled mobility in stochastic and dynamic wireless networks, On a direct estimator for average production intervals, A robust queueing network analyzer based on indices of dispersion, Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees, Constraints on Fluctuations in Sparsely Characterized Biological Systems, Stabilizing performance in a single-server queue with time-varying arrival rate, Extending the FCLT version of \(L=\lambda W\), Little's law when the average waiting time is infinite, Sample-path analysis of general arrival queueing systems with constant amount of work for all customers, Boundary driven zero-range processes in random media, ESTIMATING WAITING TIMES WITH THE TIME-VARYING LITTLE'S LAW, On pathwise behavior of queues, Correction note on \(L={\lambda{}}W\), A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues, Continuous polling models and application to ferry assisted WLAN, Incorporating priorities for waiting customers in the hypercube queuing model with application to an emergency medical service system in Brazil, Periodic Little’s Law, Delay and partial system contents for a discrete-time G-D-c queue, A central-limit-theorem version of the periodic Little's law, Sample-path analysis of stochastic discrete-event systems, Travel times in queueing networks and network sojourns, Rate conservation laws: A survey, Multi-server queueing systems with multiple priority classes, Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula, Performance analysis and buffer allocations in some open assembly systems., A note on the discretization of Little's result
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous versions of the queuing formulas L=lambdaW and H=lambdaG
- A distributional form of Little's law
- A central-limit-theorem version of \(L=\lambda W\)
- Stationary random processes associated with point processes
- Sample path analysis of level crossings for the workload process
- Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability
- Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\)
- EPSTA: The coincidence of time-stationary and customer-stationary distributions
- Sample-path analysis of processes with imbedded point processes
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- A Survey of J. Little's Formula
- The derivation of invariance relations in complex queueing systems with stationary inputs
- A Note on a Sample-Path Rate Conservation Law and its Relationship withH=λG
- On Arrivals That See Time Averages
- The intensity conservation law for queues with randomly changed service rate
- Sample-path derivations of the excess, age, and spread distributions
- Estimating Average Production Intervals Using Inventory Measurements: Little's Law for Partially Observable Processes
- An LIL Version of L = λW
- An extremal property of the fifo discipline via an ordinal version of
- Extensions of the Queueing Relations L = λW and H = λG
- A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks
- A Proof for the Queuing Formula: L = λW
- Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes
- Conservation Equations and Variance Reduction in Queueing Simulations
- The Relation between Customer and Time Averages in Queues
- Hierarchical Production Planning: A Two-Stage System
- The System Point Method in Exponential Queues: A Level Crossing Approach
- On rate conservation for non-stationary processes
- An elementary proof of Sengupta's invariance relation and a remark on Miyazawa's conservation principle
- The Asymptotic Efficiency of Simulation Estimators
- Event and time averages: a review
- Einige Anwendungen der Theorie zufälliger Punktprozesse in der Bedienungstheorie I
- Efficient Estimators for Simulated Queueing Systems
- Time and customer processes in queues with stationary inputs
- On up- and downcrossings
- Level Crossings in Point Processes Applied to Queues: Single-Server Case
- A formal approach to queueing processes in the steady state and their applications
- Ordinary CLT and WLLN Versions of L = λW
- The Distributional Little's Law and Its Applications
- Technical Note—A Last Word on L = λW
- A Simple Proof of: L = λW
- On the relation between customer and time averages in queues
- A relation between stationary queue and waiting time distributions
- On the Optimality of Single-Server Queuing Systems
- L = λW: A Discounted Analogue and a New Proof
- Regenerative processes in the theory of queues, with applications to the alternating-priority queue
- A Generalization of L = λW to Moments of Queue Length and Waiting Times
- Indirect Estimation Via L = λW
- Rate conservation for stationary processes
