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.

Authors
Publisher
Maik Nauka Publishing / Springer SBM
Number of issue
5
Language
English
Pages
885-896
Status
Published
Volume
70
Year
2009
Organizations
  • 1 Peoples Friendship University, Moscow, Russian Federation
Keywords
Automation; Control; Finite capacity; Last-come first-served; Single server; Queueing theory
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/2998/
Share

Other records