The overall sojourn time in tandem queues with identical successive service times and renewal input (Q1336992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The overall sojourn time in tandem queues with identical successive service times and renewal input |
scientific article; zbMATH DE number 672066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The overall sojourn time in tandem queues with identical successive service times and renewal input |
scientific article; zbMATH DE number 672066 |
Statements
The overall sojourn time in tandem queues with identical successive service times and renewal input (English)
0 references
8 November 1994
0 references
A tandem queue with \(m + 1\) successive queues \((m \geq 1)\) having infinite waiting rooms and a renewal arrival process is considered. Successive service times are i.i.d. r.v.s (having the same distribution at all phases). The probability distribution of the overall sojourn time is derived in terms of the Laplace-Stieltjes transform.
0 references
Pollaczek's method
0 references
renewal input
0 references
tandem queue
0 references
overall sojourn time
0 references
Laplace-Stieltjes transform
0 references
0.8575813174247742
0 references
0.8187952041625977
0 references
0.816886305809021
0 references
0.8047339916229248
0 references
