1983Advances in Applied ProbabilityRequires access

Sojourn times in closed queueing networks

F. P. Kelly, P. K. Pollett

Open publisher page 88 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 88 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Mathematics, Queueing theory, Instant, Distribution (mathematics), Simple (philosophy), Representation (politics), Joint probability distribution, Path (computing)

Related papers

Back to paper searchBrowse research topicsOriginal source
Sojourn times in closed queueing networks — Research Paper | ScholarLens