A law of the iterated logarithm for the sojourn time process in queues in series
DOI10.1007/s11009-014-9402-yzbMath1336.60179OpenAlexW2023873621MaRDI QIDQ267866
Vladimiras Dolgopolovas, Leonidas L. Sakalauskas, Saulius Minkevičius
Publication date: 12 April 2016
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-014-9402-y
law of the iterated logarithmheavy trafficMonte Carlo simulationsojourn timequeueing systemsstatistical modeling
Extreme value theory; extremal stochastic processes (60G70) Monte Carlo methods (65C05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Strong limit theorems (60F15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Functional limit theorems; invariance principles (60F17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic analysis of telegraphic message switching systems
- Asymptotic stationarity of queues in series and the heavy traffic approximation
- Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking
- Extreme values of birth and death processes and queues
- Weak convergence in multiphase queues
- A central-limit-theorem version of \(L=\lambda W\)
- Stochastic discrete flow networks: Diffusion approximations and bottlenecks
- Strong approximations for the open queueing network in heavy traffic
- Extreme value theory for queues via cycle maxima
- Extreme and high-level sojourns of the single server queue in heavy traffic
- A law of the iterated logarithm for global values of waiting time in multiphase queues.
- On the law of the iterated logarithm in open queueing networks
- Brownian models of multiclass queueing networks: Current status and open problems
- A network of priority queues in heavy traffic: One bottleneck station
- Sufficient conditions for functional-limit-theorem versions of \(L=\lambda W\)
- Strong approximations for multiclass feedforward queueing networks.
- Heavy-traffic extreme-value limits for queues
- On the law of the iterated logarithm in multiphase queueing systems
- About the sojourn time process in multiphase queueing systems
- Asymptotic relations in queueing theory
- Heavy Traffic Analysis of Polling Systems in Tandem
- Maximum Values in Queueing Processes
- On the law of the iterated logarithm in multiserver open queueing networks
- Open Queueing Networks in Heavy Traffic
- Variants on the Law of the Iterated Logarithm
- Extreme Values of Queue Lengths in M/G/1 and GI/M/1 Systems
- An LIL Version of L = λW
- A note on networks of infinite-server queues
- On the heavy-traffic limit theorem for GI/G/∞ queues
- Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems
- Heavy Traffic Limit Theorems for Queues: A Survey
- State of the Art—Networks of Queues: A Survey of Weak Convergence Results
- On a tandem queueing model with identical service times at both counters, II
- Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions
- An invariance principle for the law of the iterated logarithm
- Multiple channel queues in heavy traffic
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- Multiple channel queues in heavy traffic. I
- Functional limit theorems for the queue GI/G/1 in light traffic
- Extreme Values in the GI/G/1 Queue
This page was built for publication: A law of the iterated logarithm for the sojourn time process in queues in series
