Probabilistic proof of the interchangeability of ./M/1 queues in series (Q1110927): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Filtering formulas and the ./M/1 queue in a quasireversible network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the ordering of tandem queues with exponential servers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal adaptive server allocation in a network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The interchangeability of ·/M/1 queues in series / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:36, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic proof of the interchangeability of ./M/1 queues in series |
scientific article |
Statements
Probabilistic proof of the interchangeability of ./M/1 queues in series (English)
0 references
1987
0 references
Given a finite number of empty./M/1 queues, let customers arrive according to an arbitrary arrival process and be served at each queue exactly once, in some fixed order. The process of departing customers from the network has the same law, whatever the order in which the queues are visited. This remarkable result, due to \textit{R. Weber} [J. Appl. Probab. 16, 690-695 (1979; Zbl 0417.60091)], is given a simple probabilistic proof.
0 references
departure process
0 references
insensitivity
0 references
point processes
0 references
tandem queues
0 references
