Article contents
Calculating exit times for series Jackson networks
Published online by Cambridge University Press: 14 July 2016
Abstract
We define a new family of special functions that we call lattice Bessel functions. They are indexed by the N-dimensional integer lattice such that they reduce to modified Bessel functions when N = 1, and the exponential function when N = 0. The transition probabilities for an M/M/1 queue going from one state to another before becoming idle (exiting at 0) can be solved in terms of modified Bessel functions. In this paper, we use lattice Bessel functions to solve the analogous problem involving the exit time from the interior of the positive orthant of the N-dimensional lattice for a series Jackson network with N nodes. These special functions allow us to derive asymptotic expansions for the taboo transition probabilities, as well as for the tail of the exit-time distribution.
Keywords
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1987
References
- 8
- Cited by