Analysis of the multi-server Markov queuing system with unlimited buffer and negative customers

Consideration was given to the multi-server queuing system with unlimited buffer, Markov input flow, and Markov (general) process of servicing all customers on servers with the number of process states and intensities of the inter-phase passage depending on the number of customers in the system. Additionally, a Markov flow of negative customers arrives to the system, the arriving negative customer killing the last queued positive customer. A recurrent algorithm to calculate the stationary probabilities of system states was obtained, and a method of calculation of the stationary distribution of the waiting time before starting servicing of a positive customer was proposed. © Nauka/Interperiodica 2007.

Authors
Bocharov P.P. 1 , D'Apice C.2 , Manzo R.2 , Pechinkin A.V. 3
Publisher
Maik Nauka Publishing / Springer SBM
Number of issue
1
Language
English
Pages
85-94
Status
Published
Volume
68
Year
2007
Organizations
  • 1 Peoples Friendship University, Moscow, Russian Federation
  • 2 University of Salerno, Salerno, Italy
  • 3 Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russian Federation
Keywords
Algorithms; Buffer storage; Markov processes; Probability; Servers; Markov flow; Phase passages; Stationary distribution; Stationary probabilities; Queueing theory
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/3289/
Share

Other records