Sojourn times in closed queueing networks
F. P. Kelly, P. K. Pollett
Abstract
F. P. Kelly, P. K. Pollett
Abstract
This paper obtains the stationary joint distribution of a customer's sojourn times along an overtake-free path in a closed multiclass Jackson network. The distribution has a simple representation in terms of the product form distribution for the state of the network at an arrival instant.
OpenAlex reports 88 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper obtains the stationary joint distribution of a customer's sojourn times along an overtake-free path in a closed multiclass Jackson network. The distribution has a simple representation in terms of the product form distribution for the state of the network at an arrival instant.
Key concepts: Mathematics, Queueing theory, Instant, Distribution (mathematics), Simple (philosophy), Representation (politics), Joint probability distribution, Path (computing)