|
Avtomatika i Telemekhanika, 1981, Issue 12, Pages 44–47
(Mi at6063)
|
|
|
|
Stochastic Systems
On one decomposition algorithm for closed-loop periodic hypererlang service networks
L. A. Grinshpan Minsk
Abstract:
A computing algorithm is developed for determining stationary probabilities of microstates in closed-loop $d$-periodic hypererlang service systems of complexity $0(n^3/d^2+(d-1)n^2/d^2+n)$ where $n$ is the number of network microstates. In comparison with a traditional approach of complexity $0(n^3+n)$ yields an asymptotic saving in time of about $d^2$ and requires less core memory.
Received: 15.08.1980
Citation:
L. A. Grinshpan, “On one decomposition algorithm for closed-loop periodic hypererlang service networks”, Avtomat. i Telemekh., 1981, no. 12, 44–47; Autom. Remote Control, 42:12 (1981), 1615–1617
Linking options:
https://www.mathnet.ru/eng/at6063 https://www.mathnet.ru/eng/at/y1981/i12/p44
|
Statistics & downloads: |
Abstract page: | 94 | Full-text PDF : | 39 | First page: | 2 |
|