Abstract
We consider an exponential queueing network that differs from a Gelenbe network (with the usual positive and so-called negative customers), first, in that the sojourn time of customers at the network nodes is bounded by a random value whose conditional distribution for a fixed number of customers in a node is exponential. Second, we significantly relax the conditions on possible values of parameters for incoming Poisson flows of positive and negative customers in Gelenbe’s theorem. Claims serviced at the nodes and customers leaving the nodes at the end of their sojourn time can stay positive, become negative, or leave the network according to different routing matrices. We prove a theorem that generalizes Gelenbe’s theorem.
Similar content being viewed by others
References
Gnedenko, B.V. and Kovalenko, I.N., Vvedenie v teoriyu massovogo obsluzhivaniya (Introduction to Queueing Theory), Moscow: Nauka, 1987.
Kovalev, E.A., Queueing Networks with BoundedWaiting Time in Queues, Avtom. Vychisl. Tekh., 1985, no. 2, pp. 50–55.
Yakubovich, O.V., Stationary Distribution for a Queueing Network with Different Types of Signals and Positive Customers and Constraint on Sojourn Time, Izv. Gomel. Gos. Univ. im. F. Skoriny, 2008, no. 5 (50), part 2, pp. 207–211.
Yakubovich, O.V. and Evdokimovich, V.E., A Queueing Network with Random Sojourn Time with Positive, Negative Customers and Signals, Probl. Fiz., Mat. Tekh., 2010, no. 4 (5), pp. 63–67.
Letunovich, Yu.E., Non-Uniform Networks with Bounded Sojourn Time in Servicing Modes, Avtom. Vychisl. Tekh., 2010, no. 5, pp. 33–41.
Yakubovich, O.V. and Dudovskaya, Yu.E., Multimodal Queueing Network with Random Sojourn Time for Different Types of Negative Customers, Probl. Fiz., Mat. Tekh., 2012, no. 4 (137), pp. 74–77.
Malinkovskii, Yu.V., Jackson Networks with Single-Line Nodes and Limited Sojourn or Waiting Times, Autom. Remote Control, 2015, vol. 76, no. 4, pp. 603–612.
Gelenbe, E., Product-Form Queueing Networks with Negative and Positive Customers, J. Appl. Prob., 1991, vol. 28, pp. 656–663.
Gelenbe, E. and Schassberger, R., Stability of G-networks, Probab. Eng. Inform. Sci., 1992, vol. 6, pp. 271–276.
Artalejo, J.R., Invited Review. G-Networks: A Versatile Approach for Work Removal in Queueing Networks, Eur. J. Oper. Res., 2000, vol. 126, pp. 233–249.
Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Ross. Univ. Druzhby Narodov, 1995.
Gikhman, I.I. and Skorokhod, A.V., Teoriya sluchainykh protsessov (Theory of Random Processes), Moscow: Nauka, 1972, vol. 2.
Kelly, F.P., Reversibility and Stochastic Networks, New York: Wiley, 1979.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.V. Malinkovskii, 2017, published in Avtomatika i Telemekhanika, 2017, No. 10, pp. 155–167.
Rights and permissions
About this article
Cite this article
Malinkovskii, Y.V. Stationary probability distribution for states of G-networks with constrained sojourn time. Autom Remote Control 78, 1857–1866 (2017). https://doi.org/10.1134/S0005117917100095
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117917100095