|
Avtomatika i Telemekhanika, 2004, Issue 11, Pages 114–121
(Mi at1664)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Queuing Systems
A finite $M\!AP_K/G_K/1$ queueing system with generalized foreground-background processor-sharing discipline
C. D'Apicea, R. Manzoa, A. V. Pechinkinb a University of Salerno
b Institute for Problems of Informatics RAS
Abstract:
Queuing systems with Markov arrival process, several customer types, generalized foreground-background processor-sharing discipline with minimal served length or separate finite buffers for customers of different types, or a common finite buffer for customers of all types are studied. Mathematical relations are derived and used to compute the joint stationary distribution of the number of customers of all types in a system.
Citation:
C. D'Apice, R. Manzo, A. V. Pechinkin, “A finite $M\!AP_K/G_K/1$ queueing system with generalized foreground-background processor-sharing discipline”, Avtomat. i Telemekh., 2004, no. 11, 114–121; Autom. Remote Control, 65:11 (2004), 1793–1799
Linking options:
https://www.mathnet.ru/eng/at1664 https://www.mathnet.ru/eng/at/y2004/i11/p114
|
Statistics & downloads: |
Abstract page: | 229 | Full-text PDF : | 64 | References: | 38 | First page: | 2 |
|