The MAP/MSP/1/r queueing system with background customers

A single server queueing system with Markov flow of principal customers and background customers arriving from infinite reserve source is studied. The Markov service processes of customers of both types are considered. The system has a finite buffer for principal customers. The service discipline is characterized by non-preemptive priority of principal customers respect to background customers. An effective matrix-recurrent algorithm for the calculation of the stationary state probabilities of the underlying Markov process is derived. © ECMS 2005.

Authors
Bocharov P. 1 , Manzo R.2 , Shlumper L.3
Conference proceedings
Proceedings of ASMTA 2005: 12th International Conference on Analytical and Stochastic Modelling Techniques and Applications
Language
English
Pages
9-12
Status
Published
Year
2005
Organizations
  • 1 Department of Probability Theory and Mathematical Statistics, Peoples' Friendship University of Russia, Miklukho-Maklaya 6, 117198 Moscow, Russian Federation
  • 2 Department of Information Engineering and Applied Mathematics, University of Salerno, Via Ponte don Melillo, 84084 Fisciano (SA), Italy
  • 3 Institute for Information Transmission Problems, RAS, Bolshoi Karetny 19, 101447 Moscow GSP-4, Russian Federation
Keywords
Background customers; Finite buffer; Markov flow; Markov service processes; Nonpreemptive priority; Queueing system
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/3429/
Share

Other records