Heavy Traffic Limit Theorems for Queues: A Survey
From MaRDI portal
(Redirected from Publication:4048352)
Recommendations
- Heavy traffic limit theorems for a sequence of shortest queueing systems
- Heavy-traffic limits for nearly deterministic queues
- Refinements to Heavy Traffic Limit Theorems in Queueing Theory
- scientific article; zbMATH DE number 4038976
- Heavy-traffic limits for nearly deterministic queues: Stationary distributions
- scientific article; zbMATH DE number 4094498
- scientific article; zbMATH DE number 4042954
- Heavy-traffic limits for queues with periodic arrival processes
- Heavy-traffic extreme-value limits for queues
- Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions
Cited in
(47)- On the rate of convergence of the diffusion approximations
- Regulated Ornstein-Uhlenbeck process in pandemic-time asset pricing of stocks and derivatives
- Heavy-traffic limits for queues with periodic arrival processes
- Coupling method for asymptotic analysis of queues with regenerative input and unreliable server
- scientific article; zbMATH DE number 7529536 (Why is no real title available?)
- A law of the iterated logarithm for the sojourn time process in queues in series
- A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
- On Lerch's transcendent and the Gaussian random walk
- Cumulants of the maximum of the Gaussian random walk
- Diffusion approximation to theG/G/R machine repair problem with warm standby spares
- Heavy-traffic single-server queues and the transform method
- Heavy traffic analysis of multi-class bipartite queueing systems under FCFS
- On extreme values in open queueing networks
- Complex transient phenomena in multiphase queuing systems. II
- Approximations for the probability of ruin within finite time
- On the analysis of the virtual waiting time in open queueing networks
- A queueing model with ON/OFF sources: approximation and stationarity
- Diffusion Approximation of State-Dependent G-Networks Under Heavy Traffic
- Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic
- Heavy traffic limit theorems for a queueing system in which customers join the shortest line
- How fast do equilibrium payoff sets converge in repeated games?
- A law of the iterated logarithm for global values of waiting time in multiphase queues.
- Relating the waiting time in a heavy-traffic queueing system to the queue length
- Weak convergence for generalized semi-Markov processes
- Brownian models of multiclass queueing networks: Current status and open problems
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types
- Jackson network in a random environment: strong approximation
- Strong approximations for multiclass feedforward queueing networks.
- The heavy traffic limit of a class of Markovian queueing models
- Examples for the Theory of Strong Stationary Duality with Countable State Spaces
- Heavy traffic limits for the extreme waiting time in multi-phase queueing systems
- Dynamic policy for idling time preservation
- The problem of stability in queueing theory
- A law of the iterated logarithm for extreme queue length in multiphase queues
- Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
- Maximum entropy random walks: the infinite setting and the example of spider networks with their scaling limits
- Asymptotic optimality of the round-robin policy in multipath routing with resequencing
- scientific article; zbMATH DE number 4042954 (Why is no real title available?)
- Heavy traffic limits for some queueing networks
- Learning unknown service rates in queues: a multiarmed bandit approach
- Little's laws for extreme values in multi-server multi-core open queueing networks
- A Double Band Control Policy of a Brownian Perishable Inventory System
- Diffusion approximation for storage processes
- Large deviation analysis of the single server queue
- Heavy-traffic limits for nearly deterministic queues: Stationary distributions
- Ladder heights, Gaussian random walks and the Riemann zeta function
- Uniform asymptotics for compound Poisson processes with regularly varying jumps and vanishing drift
This page was built for publication: Heavy Traffic Limit Theorems for Queues: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4048352)
