Using the M/G/1 queue under processor sharing for exact simulation of queues
From MaRDI portal
Publication:333069
DOI10.1007/S10479-013-1408-2zbMATH Open1351.90083OpenAlexW2041331362MaRDI QIDQ333069FDOQ333069
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
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
- Applied Probability and Queues
- Stochastic simulation: Algorithms and analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite exponential moments for branching processes and busy periods for queues
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Geometric ergodicity and perfect simulation
- Exact simulation of the stationary distribution of the FIFO M/G/\(c\) queue
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Exact simulation of the stationary distribution of the FIFO M/G/c queue: the general case for \(\rho < c\)
Cited In (7)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion
- Perfect simulation of \(\mathrm{M}/\mathrm{G}/c\) queues
- 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)
