1990•Stochastic ModelsRequires access

Approximations to the moments of the sojourn time in a tandem queue with overtaking

Charles Knessl, Charles Tier

Abstract

The sojourn time in a tandem queue with exponential servers and a Pois-son arrival process is considered. Overtaking is possible since the first node is processor-shared and the second node is first-come-first served. Asymptotic approximations are constructed for the first two moments of the sojourn time conditioned on the number in each node on arrival. Our approximations are shown to be in good agreement with simulated results.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 8 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

Key concepts: Overtaking, Queue, Node (physics), Exponential function, Mathematics, Fork–join queue, Tandem, Computer science