The Stationary Characteristics of the G/MSP/1/r Queueing System

A single-server queueing system with recurrent input flow and Markov service process is considered. Both the cases of finite and infinite buffers are investigated. The analysis of this system is based on the method of embedded Markov chain. The main stationary characteristics of system performance are derived.

Авторы
Bocharov P.P. 1 , D'Apice C.2 , Pechinkin A.V.3 , Salerno S.2
Редакторы
-
Издательство
Maik Nauka Publishing / Springer SBM
Номер выпуска
2
Язык
Английский
Страницы
288-301
Статус
Опубликовано
Подразделение
-
Номер
-
Том
64
Год
2003
Организации
  • 1 Peoples Friendship University, Moscow, Russian Federation
  • 2 Salerno University, Salerno, Italy
  • 3 Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russian Federation
Ключевые слова
Markov processes; Matrix algebra; Probability distributions; Servers; Statistical methods; Vectors; Markov service process (MSP); Queueing theory
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/106/