×

Determining the exit time distribution for a closed cyclic network. (English) Zbl 0789.60074

Summary: Consider a closed, \(N\)-node, cyclic network, where each node has an independent, exponential single server. Using lattice-Bessel functions, we can explicitly solve for the transition probabilities of events that occur prior to one of the nodes becoming empty. This calculation entails associating with this absorbing process a symmetry group that is the semidirect product of simpler groups. As a byproduct, we are able to compute explicitly the entire spectrum for the finite-dimensional matrix generator of this process. When the number of nodes exceeds 1, such a spectrum is no longer purely real. Moreover, we are also able to obtain the quasistationary distribution or the limiting behavior of the network conditioned on no node ever being idle.

MSC:

60K25 Queueing theory (aspects of probability theory)
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Baccelli, F.; Massey, W. A., On the busy period of certain classes of queueing networks, (Iazeolla, G.; Courtois, P. J.; Boxma, O. J., Computer Performance and Reliability. Computer Performance and Reliability, Proc. 2nd Internat. MCPR Workshop, Rome, Italy, May 25-29, 1987 (1988))
[2] Darroch, J. N.; Seneta, E., On quasi-stationary distributions in absorbing discrete-time finite Markov chains, J. Appl. Probab., 2, 88-100 (1965) · Zbl 0134.34704
[3] Feller, W., An Introduction to Probability Theory and its Applications, Vol. I (1968), Wiley: Wiley New York · Zbl 0155.23101
[4] Jackson, J. R., Jobshop-like queueing systems, Management Sci., 10, 131-142 (1963)
[5] Keilson, J., Markov Chain Models — Rarity and Exponentiality (1979), Springer: Springer Berlin · Zbl 0411.60068
[6] Ledermann, W.; Reuter, G. E.H., Spectral theory for the differential equations of simple birth and death processes, Phil. Trans. R. Soc. London A, 246, 321-369 (1954) · Zbl 0059.11704
[7] Massey, W. A., Calculating Exit Times for Series Jackson Networks, J. Appl. Probab., 24, 226-234 (1987) · Zbl 0626.60091
[8] Miller, W., Symmetry Groups and their Applications (1972), Academic Press: Academic Press New York · Zbl 0306.22001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.