Abstract
A network of single-server nodes fed by customers of several classes is considered. Each customer is equipped with the random work to be done for completing service. The distribution of this work and the rate of its decreasing during the service depend on the node, the class of the customer, the queue contents and the residual work loads of the customers at the node. The service discipline is LCFS preemptive-resume. For both open and closed network, the stationary distribution is derived. In general, this distribution is not a product form. For the open network, sufficient conditions yielding the product form are given. For both open and closed network, sufficient invariance conditions are found.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.M. Alexandrov, On busy period of some system with dependent service times, Proc. Acad. Sci. USSR Ser. Engrg. Cybernet. 8(3) (1970) 75-85 (in Russian).
F. Baskett, K.M. Chandy, R.R. Muntz and F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. Assoc. Comput. Mach. 22(2) (1975) 248-260.
A.A. Borovkov, Random Processes in Queueing Theory (Springer, Berlin, 1976).
K.M. Chandy, Jr., J.H. Howard and D.F. Towsley, Product form and local balance in queueing networks, J. Assoc. Comput. Mach. 24(2) (1977) 250-263.
K.M. Chandy and J. Martin, A characterization of product form queueing networks, J. Assoc. Comput. Mach. 30(2) (1983) 286-299.
P. Franken, D. König, U. Arndt and V. Schmidt, Queues and Point Processes (Akademie-Verlag, Berlin; Wiley, New York, 1980).
B. Gnedenko and I. Kovalenko, An Introduction to Queueing Theory (Israel Program for Scientific Transl., Jerusalem, 1968).
V.A. Ivnitski, One-server queueing system with queue, Proc. Acad. Sci. USSR Ser. Engrg. Cybernet. 9(6) (1971) 110-120 (in Russian).
V.A. Ivnitski, On a condition of invariance of state probabilities for queueing networks, Theory Probab. Appl. 27 (1982) 196-200.
N.K. J aiswal, Priority Queues (Academic Press, New York, 1968).
U. Jansen, On the Poisson output of queueing systems with dependent service times, Math. Operations forsch. Statist. Ser. Optimization (1980).
F.I. John, Single server queues with dependent service and interarrival times, J. Soc. Indust. Appl. Math. 11(3) (1963) 526-534.
D. König, K. Matthes and K. Nawrotzki, Verallgemeinerungen dez Erlangschen and Engsetschen Formeln, in: Eine Methode in der Bedienungstheorie (Akademie-Verlag, Berlin, 1967).
D. König, V.V. Rykov and F. S chmidt, Stationary queueing systems with dependences, Sums of Science and Technology, Ser. Theory Probab. Math. Statist. Theor. Cybernet. 18 (1981) 95-186 (in Russian).
I.N. Kovalenko, Sur la condition pour que, en regime stationnaire, la distribution soit independante des lois des durees de conversation, Ann. des Télécommunications 17(7-8) (1962) 190-191.
R.M. Loynes, The stability of a queue with non-independent interarrival and service times, Proc. Cambridge Philos. Soc. 58(3) (1962) 497-520.
M. Miyazawa, Insensitivity and product-form decomposability of reallocatable GSMP, Adv. in Appl. Probab. 2 (1993) 415-437.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ivnitski, V.A. Network of Single-Server Queues with Dependent Service Times. Queueing Systems 37, 363–377 (2001). https://doi.org/10.1023/A:1010889400673
Issue Date:
DOI: https://doi.org/10.1023/A:1010889400673