Strong embeddings for transitory queueing models
From MaRDI portal
Publication:5085131
Abstract: In this paper we establish strong embedding theorems, in the sense of the Komlos-Major-Tusnady framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and non-Markovian nature of these models makes the computation of performance metrics hard. The strong embeddings yield error bounds on sample path approximations by diffusion processes, in the form of functional strong approximation theorems.
Recommendations
Cites work
- ?/M/1: On the equilibrium distribution of customer arrivals
- A data-driven model of an appointment-generated arrival process at an outpatient clinic
- A new approach to strong embeddings
- A queueing model with independent arrivals, and its fluid and diffusion limits
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- An asymptotic representation of the sample distribution function
- An invariance principle for the law of the iterated logarithm
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Asymptotically optimal appointment schedules
- Asymptotically optimal controls for time-inhomogeneous networks
- Directional derivatives of oblique reflection maps
- Heavy-traffic analysis through uniform acceleration of queues with diminishing populations
- Heavy-traffic limits for a single-server queue leading up to a critical point
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 786522 (Why is no real title available?)
- scientific article; zbMATH DE number 3065414 (Why is no real title available?)
- Large finite population queueing systems: The single-server model
- On the accuracy of Kingman's heavy traffic approximation in the theory of queues
- Rare events of transitory queues
- Rational queueing
- Reducing Delays for Medical Appointments: A Queueing Approach
- Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
- Strategic arrivals into queueing networks: the network concert queueing game
- Strong approximation for Markovian service networks
- Strong approximation of renewal processes
- Strong Approximations for Time-Dependent Queues
- Strong approximations for time-varying infinite-server queues with non-renewal arrival and service processes
- The concert queueing game: to wait or to be late
This page was built for publication: Strong embeddings for transitory queueing models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085131)
