Abstract
We consider an exponential queueing network with single-line nodes that differs from a Jackson network only in that the time claims sojourn in the system (waiting time for the servicing) at the network’s nodes is limited by an exponentially distributed random value. Claims serviced at nodes and claims that have not finished servicing (that exceeded maximal waiting time) move along the network according to different routing matrices. We prove a theorem that generalizes Jackson’s theorem for open and closed networks.
This is a preview of subscription content, log in via an institution to check access.
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.
Malinkovskii, Yu.V., Queuing Networks with Routing of Calls at Nodes, Autom. Remote Control, 1991, vol. 52, no. 2, part 2, pp. 225–231.
Malinkovskii, Yu.V., Queueing Networks with Symmetric Reserve Channels, Izv. Akad. Nauk SSSR, Tekh. Kiber., 1986, no. 4, pp. 69–77.
Kovalev, E.A. and Malinkovskii, Yu.V., Queueing Networks with Reserve Devices, Avtom. Vychisl. Tekh., 1987, no. 2, pp. 64–70.
Kovalev, E.A., Queueing Networks with Restricted Waiting Time in Queues, Avtom. Vychisl. Tekh., 1985, no. 2, pp. 50–55.
Yakubovich, O.V., Stationary Distribution for a Queueing Network with Different Signal Types, Positive Claims, and a Constraint on the Waiting 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 RandomWaiting Time of Positive, Negative Claims and Signals, Probl. Fiz., Mat. Tekh., 2010, no. 4 (5), pp. 63–67.
Letunovich, Yu.E., Non-Uniform Networks with a Constraint on the Waiting Time in Service Modes, Avtom. Vychisl. Tekh., 2010, no. 5, pp. 33–41.
Yakubovich, O.V. and Dudovskaya, Yu.E., A Multimodal Queueing Network with Random Waiting Times for Different Types of Negative Claims, Probl. Fiz., Mat. Tekh., 2012, no. 4 (137), pp. 74–77.
Melamed, B., Characterizations of Poisson Traffic Streams in Jackson Queueing Network, Adv. Appl. Probab., 1979, vol. 11, no. 2, pp. 422–438.
Foster, F.G., On Stochastic Matrices Assosiated with Certain Queueing Process, Ann. Math. Statist., 1953, vol. 24, no. 2, pp. 355–360.
Gikhman, I.I. and Skorokhod, A.V., Teoriya sluchainykh protsessov (Theory of Random Processes), Moscow: Nauka, 1972, vol. 2.
Yakushev, Yu.F., A Method for Analyzing Certain Queueing Networks, Izv. Akad. Nauk SSSR, Tekh. Kiber., 1984, no. 6, pp. 73–81.
Kelly, F.P., Reversibility and Stochastic Networks, New York: Wiley, 1979.
Kelly, F.P., Network of Queues, Adv. Appl. Probab., 1976, vol. 8, no. 2, pp. 416–432.
Pollet, P.K., Preserving Partial Balance in Continuous-time Markov Chains, Adv. Appl. Probab., 1987, vol. 19, no. 2. R. 431–453.
Gordon, W.J. and Newell, G.F., Closed Queueing Systems with Exponential Servers, Oper. Res., 1967, vol. 15, no. 2, pp. 254–265.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © Yu.V. Malinkovskii, 2015, published in Avtomatika i Telemekhanika, 2015, No. 4, pp. 67–79.
Rights and permissions
About this article
Cite this article
Malinkovskii, Y.V. Jackson networks with single-line nodes and limited sojourn or waiting times. Autom Remote Control 76, 603–612 (2015). https://doi.org/10.1134/S0005117915040050
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117915040050