A finite capacity BMAPK/GK/1 queue with the generalized foreground-background processor-sharing discipline
From MaRDI portal
Publication:2457519
Recommendations
- A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
- The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline
- scientific article; zbMATH DE number 1535833
- Processor-sharing and random-service queues with semi-Markovian arrivals
- On the M/G/1 foreground-background processor-sharing queue
Cites work
Cited in
(11)- An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
- On the M/G/1 foreground-background processor-sharing queue
- The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline
- A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
- A single-server queueing system with background customers
- Single server retrial queue with group admission of customers
- scientific article; zbMATH DE number 1535833 (Why is no real title available?)
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- A foreground-background queueing model with speed or capacity modulation
- On the distribution of the number of consecutively lost customers in the \textit{BMAP}/\textit{PH}/1/\textit{N} system
- Processor sharing: a survey of the mathematical theory
This page was built for publication: A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457519)