BMAP/G/1/∞ system with last come first served probabilistic priority

Consideration was given to the BMAP/G/1/∞ single-server queuing system with batch Markov arrivals, arbitrary servicing, finite-capacity buffer, and last come first served probabilistic priority. Equations for determination of the stationary probabilities of states and stationary characteristics associated with the time of customer sojourn in the system were determined. © 2009 Pleiades Publishing, Ltd.

Авторы
Издательство
Maik Nauka Publishing / Springer SBM
Номер выпуска
5
Язык
Английский
Страницы
885-896
Статус
Опубликовано
Том
70
Год
2009
Организации
  • 1 Peoples Friendship University, Moscow, Russian Federation
Ключевые слова
Automation; Control; Finite capacity; Last-come first-served; Single server; Queueing theory
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/2998/
Поделиться

Другие записи