A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline

DOI10.1134/S0005117906030076zbMath1125.90331OpenAlexW1974500859MaRDI QIDQ2457519

Rosanna Manzo, Ciro D' Apice

Publication date: 23 October 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117906030076

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

Single server retrial queue with group admission of customers ⋮ 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

Cites Work

• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
• Unnamed Item
• Unnamed Item

This page was built for publication: A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline