On network flow equations and splitting formulas for sojourn times in queueing networks (Q1178670)
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: On network flow equations and splitting formulas for sojourn times in queueing networks |
scientific article; zbMATH DE number 22180
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On network flow equations and splitting formulas for sojourn times in queueing networks |
scientific article; zbMATH DE number 22180 |
Statements
On network flow equations and splitting formulas for sojourn times in queueing networks (English)
0 references
26 June 1992
0 references
Summary: \textit{A. J. Lemoine's} network flow equations [J. Appl. Probab. 24, 495- 510 (1987; Zbl 0627.60092)] are generalized to the case of multiserver networks. These equations provide a basis for recursive evaluation of residual conditional sojourn time moments.
0 references
Lemoine's network flow equations
0 references
Jackson networks
0 references
residual conditional sojourn time moments
0 references
multiserver networks
0 references
