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.

Authors
Bocharov P.P. 1 , D'Apice C.2 , Pechinkin A.V.3 , Salerno S.2
Publisher
Maik Nauka Publishing / Springer SBM
Number of issue
2
Language
English
Pages
288-301
Status
Published
Volume
64
Year
2003
Organizations
  • 1 Peoples Friendship University, Moscow, Russian Federation
  • 2 Salerno University, Salerno, Italy
  • 3 Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russian Federation
Keywords
Markov processes; Matrix algebra; Probability distributions; Servers; Statistical methods; Vectors; Markov service process (MSP); Queueing theory
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/106/
Share

Other records