Abstract
Consideration was given to the model of a queuing network with resource queuing systems—the multi-server systems with losses where servicing of the accepted customer occupies random volumes of resources with the given distribution function depending on the customer class and the type of required servicing. Customer servicing in a node can be interrupted by a signal arriving at an exponential time from the start of servicing, and during the time of customer sojourn in the network it may be interrupted more than once. Analytical formulas for calculation of the fundamental probability-time model characteristics—including the joint distribution functions of the number of customers in the nodes and the volumes of resources occupied by them—were proposed on the assumption of the Poisson flows incoming to the nodes and arbitrary servicing.
Similar content being viewed by others
References
Romm, E.L. and Skitovitch, V.V., On Certain Generalization of the Problem of Erlang, Autom. Remote Control, 1971, vol. 32, no. 6, pp. 1000–1003.
Tikhonenko, O.M., Determination of Characteristics of Queuing Systems with Limited Memory, Autom. Remote Control, 1997, vol. 58, no. 6, pp. 969–973.
Tikhonenko, O.M. and Klimovich, K.G., Analysis of Queuing Systems for Random-Length Arrivals with Limited Cumulative Volume, Probl. Inform. Transmis., 2001, vol. 37, no. 1, pp. 70–79.
Tikhonenko, O.M., Generalized Erlang Problem for Queueing Systems with Bounded Total Size, Probl. Inform. Transmis., 2005, vol. 41, no. 3, pp. 243–253.
Naumov, V. and Samouylov, K., On Relationship between Queuing Systems with Resources and Erlang Networks, Inform. Appl., 2016, vol. 10, no. 3, pp. 9–14.
Gelenbe, E., Random Neural Networks with Negative and Positive Signals and Product Form Solution, Neural Comput., 1989, vol. 1, no. 4, pp. 502–510.
Artalejo, J.R., G-Networks: A Versatile Approach for Work Removal in Queueing Networks, Eur. J. Oper. Res., 2000, vol. 126, no. 2, pp. 233–249.
Bocharov, P.P. and Vishnevskii, V.M., G-Networks: Development of the Theory of Multiplicative Networks, Autom. Remote Control, 2003, vol. 64, no. 5, pp. 714–739.
Fourneau, J.M., Gelenbe, E., and Suros, R., G-Networks with Multiple Classes of Negative and Positive Customers, Theor. Comput. Sci., 1996, vol. 155, no. 1, pp. 141–156.
Gelenbe, E., G-Networks with Triggered Customer Movement, J. Appl. Prob., 1993, vol. 30 (3), pp. 742–748.
Naumov, V. and Samouylov, K., Analysis of Multi-Resource Loss System with State Dependent Arrival and Service Rates, Prob. Eng. Inform. Sci., 2017, vol. 31, no. 4, pp. 413–419.
Busen, J.P., Computational Algorithms for Closed Queueing Networks with Exponential Servers, Comm. ACM, 1973, vol. 16, pp. 527–531.
Petrov, V., Solomitckii, D., Samuylov, A., et al., Dynamic Multi-Connectivity Performance in Ultra- Dense UrbanmmWave Deployments, IEEE J. Selected Areas Commun., 2017, vol. 35(9), pp. 2038–2055.
Naumov, V.A., Samuilov, K.E., and Samuilov, A.K., On the Total Amount of Resources Occupied by Serviced Customers, Autom. Remote Control, 2016, vol. 77, no. 8, pp. 1419–1427.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.A. Naumov, K.E. Samuilov, 2018, published in Avtomatika i Telemekhanika, 2018, No. 5, pp. 59–68.
Rights and permissions
About this article
Cite this article
Naumov, V.A., Samuilov, K.E. Analysis of Networks of the Resource Queuing Systems. Autom Remote Control 79, 822–829 (2018). https://doi.org/10.1134/S0005117918050041
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117918050041