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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
