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

DOI10.1007/S10479-013-1408-2MaRDI QIDQ333069zbMATH OpenOpenAlexFDO

Authors 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 theoryexact simulationprocessor sharing

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• The M/G/1 queue with processor sharing and its relation to a feedback queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• The M/G/1 processor sharing queue as the almost sure limit of feedback queues
• Processor-sharing queues: Some progress in analysis
• Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues
• Response times in gated M/G/1 queues: The processor-sharing case
• The \(M/G/1\) processor-sharing queue with disasters

Cites work

• scientific article; zbMATH DE number 1631026 (Why is no real title available?)
• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 1093829 (Why is no real title available?)
• 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\)
• Geometric ergodicity and perfect simulation
• On finite exponential moments for branching processes and busy periods for queues
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Stochastic simulation: Algorithms and analysis

Cited in

(7)

• Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues
• Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
• Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for \(\rho < c\)
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Simulation models to support the preliminary electoral results program for the Mexican electoral institute
• On the M/G/1 foreground-background processor-sharing queue
• Exact simulation of the stationary distribution of the FIFO M/G/\(c\) queue

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

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