Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T04:14:55.817Z Has data issue: false hasContentIssue false

FINDING NON-STATIONARY STATE PROBABILITIES OF G-NETWORK WITH SIGNALS AND CUSTOMERS BATCH REMOVAL

Published online by Cambridge University Press:  03 May 2017

Mikhail Matalytski*
Affiliation:
Faculty of Mathematics and Computer Science, Grodno State University, Grodno, Belarus E-mail: m.matalytski@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper is devoted to the research of an open Markov queueing network with positive customers and signals, and positive customers batch removal. A way of finding in a non-stationary regime time-dependent state probabilities has been proposed. The Kolmogorov system of difference-differential equations for state probabilities of such network was derived. The technique of its building, based on the use of the modified method of successive approximations combined with a series method, has been proposed. It is proved that the successive approximations converge over time to the stationary state probabilities, and the sequence of approximations converges to the unique solution of the Kolmogorov equations. Any successive approximation can be represented as a convergent power series with infinite radius of convergence, the coefficients of which satisfy the recurrence relations; that is useful for estimations. Model example illustrating the finding of time-dependent state probabilities of the network has been provided.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2017