Using the \(M/G/1\) queue under processor sharing for exact simulation of queues

DOI10.1007/s10479-013-1408-2zbMath1351.90083OpenAlexW2041331362MaRDI QIDQ333069

Karl Sigman

Publication date: 9 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1408-2

zbMATH Keywords

queueing theoryprocessor sharingexact simulation

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (2)

Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion ⋮ Simulation models to support the preliminary electoral results program for the Mexican electoral institute

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for \(\rho < c\)
• Geometric ergodicity and perfect simulation
• Stochastic simulation: Algorithms and analysis
• Exact simulation of the stationary distribution of the FIFO M/G/c queue
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Applied Probability and Queues
• On finite exponential moments for branching processes and busy periods for queues
• Exact sampling with coupled Markov chains and applications to statistical mechanics

This page was built for publication: Using the \(M/G/1\) queue under processor sharing for exact simulation of queues