|
Avtomatika i Telemekhanika, 2005, Issue 2, Pages 73–91
(Mi at1326)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Queuing Systems
A single-server finite-capacity queueing system with Markov flow and discrete-time service
P. P. Bocharov, E. V. Viskova Peoples Friendship University of Russia
Abstract:
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.
Citation:
P. P. Bocharov, E. V. Viskova, “A single-server finite-capacity queueing system with Markov flow and discrete-time service”, Avtomat. i Telemekh., 2005, no. 2, 73–91; Autom. Remote Control, 66:2 (2005), 233–248
Linking options:
https://www.mathnet.ru/eng/at1326 https://www.mathnet.ru/eng/at/y2005/i2/p73
|
Statistics & downloads: |
Abstract page: | 307 | Full-text PDF : | 101 | References: | 27 | First page: | 1 |
|