A central-limit-theorem version of \(L=\lambda W\)
From MaRDI portal
Publication:1122879
DOI10.1007/BF01536188zbMath0676.60088OpenAlexW1481778483MaRDI QIDQ1122879
Publication date: 1986
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01536188
functional central limit theoremscentral limit theoremcomputer simulationqueueing theoryestimation of queueing system parameters
Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
A law of the iterated logarithm for the sojourn time process in queues in series, Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic, Diffusion approximations for open queueing networks with service interruptions, Little laws for utility processes and waiting times in queues, Estimation Methods for Delays in Non-regenerative Discrete-Event Systems, Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback, Estimation methods for passage times using one-dependent cycles, Asymptotic variability analysis for a two-stage tandem queue. I: The functional law of the iterated logarithm, The (functional) law of the iterated logarithm of the sojourn time for a multiclass queue, Extending the FCLT version of \(L=\lambda W\), A functional law of the iterated logarithm for multi-class queues with batch arrivals, Correction note on \(L={\lambda{}}W\), Stochastic quasigradient methods for optimization of discrete event systems, Sensitivity analysis and optimization of stochastic Petri nets, A survey of parameter and state estimation in queues, Periodic Little’s Law, How to optimize discrete-event systems from a single sample path by the score function method, Modified importance sampling for performance evaluation and sensitivity analysis of computer simulation models, Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\), Sample-path analysis of processes with imbedded point processes, Statistical Estimate of the Traffic Coefficient for a Multichannel Queueing System with Regenerative Input Flow, A central-limit-theorem version of the periodic Little's law, A law of iterated logarithm for multiclass queues with preemptive priority service discipline, A review of \(L=\lambda W\) and extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous versions of the queuing formulas L=lambdaW and H=lambdaG
- Functional laws of the iterated logarithm for the partial sums of i.i.d. random variables in the asymmetric stable law
- A Proof for the Queuing Formula: L = λW
- Some Useful Functions for Functional Limit Theorems
- Conservation Equations and Variance Reduction in Queueing Simulations
- Functional limit theorems for stochastic processes based on embedded processes
- Technical Note—A Last Word on L = λW
- An invariance principle for the law of the iterated logarithm
- Weak convergence of the average of flag processes
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Stochastic Abelian and Tauberian theorems
