Perfect sampling of a single-server queue with periodic Poisson arrivals

DOI10.1007/S11134-014-9431-9MaRDI QIDQ2352991zbMATH OpenOpenAlexWikidataFDO

Authors Yaofei Xiong, Duncan J. Murdoch, David A. Stanford

Publication date 7 July 2015

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11134-014-9431-9

zbMATH Keywords

perfect samplingperiodic Poisson processregenerative methodtime-varying queues

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Queueing theory (aspects of probability theory) (60K25) Monte Carlo methods (65C05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Perfect sampling of GI/GI/\(c\) queues
• Perfect and nearly perfect sampling of work-conserving queues
• Perfect sampling for queues and network models
• Perfect sampling for infinite server and loss systems
• Perfect Sampling of Networks with Finite and Infinite Capacity Queues

Cites work

• A Markov chain approach to periodic queues
• A sample path analysis of the M_t/M_t/c queue
• Applied Probability and Queues
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Exact simulation of the stationary distribution of the FIFO M/G/c queue
• Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for \(\rho < c\)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 1093829 (Why is no real title available?)
• Introduction to probability models
• Limit theorems for periodic queues
• On the single-server queue with non-homogeneous Poisson input and general service time
• Perfect and nearly perfect sampling of work-conserving queues
• Perfect sampling for infinite server and loss systems
• Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
• Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
• Simulating the maximum of a random walk
• Some universal limits for nonhomogeneous birth and death processes
• Stationarity detection in the initial transient problem
• Stochastic simulation: Algorithms and analysis
• The transient solution of time-dependent M/M/1 queues
• Transient and periodic solution to the time-inhomogeneous quasi-birth death process

Cited in

(8)

• Perfect sampling of GI/GI/\(c\) queues
• Perfect and nearly perfect sampling of work-conserving queues
• Perfect Sampling of Networks with Finite and Infinite Capacity Queues
• Perfect sampling for infinite server and loss systems
• Exact Sampling of Stationary and Time-Reversed Queues
• Perfect Sampling of Hawkes Processes and Queues with Hawkes Arrivals
• A rare-event simulation algorithm for periodic single-server queues
• Omnithermal perfect simulation for multi-server queues

This page was built for publication: Perfect sampling of a single-server queue with periodic Poisson arrivals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352991)