A single-server finite-capacity queueing system with Markov flow and discrete-time service

Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server finite-capacity queueing system with Markov flow and discrete-time service is studied. An algorithm for computing the stationary state probability distribution of the system is designed. The main performance characteristics, such as the stationary loss probability and mean waiting time for service, are determined. © 2005 Pleiades Publishing, Inc.

Authors
Bocharov P.P. 1 , Viskova E.V. 1
Journal
Automation and Remote Control
Publisher
Maik Nauka Publishing / Springer SBM
Number of issue
2
Language
English
Pages
233-248
Status
Published
Link
External link
DOI
10.1007/s10513-005-0047-8
Volume
66
Year
2005
Organizations
  • 1 Peoples Friendship University, Moscow, Russian Federation
Keywords
Algorithms; Communication systems; Computer networks; Discrete time control systems; Markov processes; Multiplexing; Probability distributions; Discrete-time services; Finite capacity queueing systems; Queueing systems; Stationary state probability; Queueing theory
Date of creation
19.10.2018
Date of change
19.10.2018
Short link
https://repository.rudn.ru/en/records/article/record/3525/
Share

Other records