A Rare-Event Simulation Algorithm for Periodic Single-Server Queues
DOI10.1287/ijoc.2017.0766zbMath1446.90063OpenAlexW2769253612WikidataQ57404042 ScholiaQ57404042MaRDI QIDQ5131711
Publication date: 9 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/106ca43c41e222f641d7bc51cf9302c859f35388
heavy trafficperiodic queuesexponential change of measurerare-event simulationruin probabilitiesreflected periodic Brownian motion
Queues and service in operations research (90B22) Brownian motion (60J65) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient simulation of non-Poisson non-stationary point processes to study queueing approximations
- Stabilizing performance in a single-server queue with time-varying arrival rate
- Equivalence of functional limit theorems for stationary point processes and their Palm distributions
- Queues with nonstationary inputs
- A Poisson limit for the departure process from a queue with many busy servers
- Heavy-traffic limits for queues with periodic arrival processes
- Perfect sampling of a single-server queue with periodic Poisson arrivals
- Stochastic simulation: Algorithms and analysis
- Stochastic-Process Limits
- Transforming Renewal Processes for Simulation of Nonstationary Arrival Processes
- Fluid and diffusion limits for queues in slowly changing environments
- Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic
- Periodic queues in heavy traffic
- Queues with non-stationary input stream: Ross's conjecture
- On queues with periodic Poisson input
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Limit theorems for periodic queues
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Unstable Asymptotics for Nonstationary Queues
- Risk Theory in a Periodic Environment: The Cramér-Lundberg Approximation and Lundberg's Inequality
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Calculating transient characteristics of the erlang loss model by numerical transform inversion
- Applied Probability and Queues
- Waiting time and workload in queues with periodic Poisson input
- STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
- Multiple channel queues in heavy traffic. II: sequences, networks, and batches
- On A Surplus Process Under A Periodic Environment
This page was built for publication: A Rare-Event Simulation Algorithm for Periodic Single-Server Queues