Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth

DOI10.1007/978-3-031-23207-7_19OpenAlexW4313344247MaRDI QIDQ6169434

Alexander N. Dudin, Che Soong Kim, Sergey Dudin, Olga S. Dudina

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-23207-7_19

zbMATH Keywords

retrialschanging effective bandwidthlimiting processor sharingMarkovian arrival flow

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• \(MMAP|M|N\) queueing system with impatient heterogeneous customers as a model of a contact center
• Call center operation model as a \(MAP/PH/N/R-N\) system with impatient customers
• A survey of retrial queueing systems
• A survey of retrial queues
• Processor sharing: a survey of the mathematical theory
• Processor-sharing queues: Some progress in analysis
• Retrial multi-server queuing system with \textit{PHF} service time distribution as a model of a channel with unreliable transmission of information
• Effective algorithm for computation of the stationary distribution of multi-dimensional level-dependent Markov chains with upper block-Hessenberg structure of the generator
• A survey on discriminatory processor sharing
• New results on the single server queue with a batch markovian arrival process
• Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals
• Retrial Queues
• The Theory of Queuing Systems with Correlated Flows
• A BMAP/PH/N SYSTEM WITH IMPATIENT REPEATED CALLS

This page was built for publication: Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth