Abstract
A class of discrete-time closed cyclic networks is analyzed, where queues at each node have ample waiting room and have independent geometric service times with possibly unequal means. If each node has a single server or if there are sufficiently many parallel servers at each node to accommodate all jobs, equilibrium vectors of product form are obtained. For some other cases, equilibrium vectors of product form need not exist. For the single-server model, a normalization constant is computed and used to determine the queue-length distribution at a node.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O.J. Boxma and H. Daduna, Sojourn times in queueing networks, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp. 401–450.
O.J. Boxma and P. Donk, On response time and cycle time distributions in a two-stage cyclic queue, Perf. Eval. 2 (1982) 181–194.
O.J. Boxma, F. Kelly and A. Konheim, The product form for sojourn time distributions in cyclic exponential queues, J. ACM 31 (1984) 128–133.
J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Commun. ACM 16 (1973) 527–531.
W.-M. Chow, The cycle time distribution of exponential cyclic queues, J. ACM 27 (1980) 281–286.
K.L. Chung,Markov Chains with Stationary Transition Probabilities, 2nd ed. (Springer, Berlin, 1967).
A.E. Conway and N.D. Georganas,Queueing Networks — Exact Computational Algorithms (M.I.T. Press, Cambridge, MA, 1989).
H. Daduna and R. Schassberger, Networks of queues in discrete time, Zeits. Oper. Res. 27 Ser. A (1983) 159–175.
W. Gordon and G. Newell, Closed queueing systems with exponential servers, Oper. Res. 15 (1967) 254–265.
P.G. Harrison, On normalizing constants in queueing networks, Oper. Res. 33 (1985) 464–468.
J.R. Jackson, Networks of waiting lines, Oper. Res. 5 (1957) 518–521.
J.R. Jackson, Jobshop-like queueing systems, Manag. Sci. 10 (1963) 131–142.
E. Koenigsberg, Cyclic queues, Oper. Res. Quart. 9 (1958) 22–35.
E. Koenigsberg, Twenty-five years of cyclic queues and closed queue networks: a review, J. Oper. Res. Soc. 33 (1982) 605–619.
J. McKenna, Asymptotic expansions of the sojourn-time distribution function of jobs in closed, product form queueing networks, J. ACM 34 (1987) 985–1003.
V. Pestien, S. Ramakrishnan and D. Sarkar, Packet transmission in a noisy-channel ring network, SIAM J. Comp. 23 (1994) 553–562.
V. Pestien and S. Ramakrishnan, Asymptotic behavior of large discrete-time cyclic queueing networks, Ann. Appl. Prob. 4 (1994) 591–606.
R. Schassberger and H. Daduna, The time for a round trip in a cycle of exponential queues, J. ACM 30 (1983) 146–150.
E. de Souza e Silva and R.R. Muntz, Queueing networks: solutions and applications, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp. 329–400.
J. Walrand, A discrete-time queueing network, J. Appl. Prob. 20 (1983) 903–909.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pestien, V., Ramakrishnan, S. Features of some discrete-time cyclic queueing networks. Queueing Syst 18, 117–132 (1994). https://doi.org/10.1007/BF01158777
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158777