A retrial queueing system with processor sharing

DOI10.1007/978-3-030-72247-0_4zbMath1470.60248OpenAlexW3149449677MaRDI QIDQ1980496

Valentina I. Klimenok, Alexander N. Dudin

Publication date: 8 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-72247-0_4

zbMATH Keywords

performance measuresqueueing systemsteady state distributionergodicity conditionlimited processor sharingtwo type of customers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
• Processor sharing: a survey of the mathematical theory
• On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
• Independent markov processes in parallel
• Algorithms for the multi-server queue with phase type service
• Queues with marked customers
• The Theory of Queuing Systems with Correlated Flows

This page was built for publication: A retrial queueing system with processor sharing