On the departure process of the split and match queue (Q915291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4151582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the departure process of the split and match queue |
scientific article; zbMATH DE number 4151582 |
Statements
On the departure process of the split and match queue (English)
0 references
1990
0 references
A system is considered which consists of two parallel queues in each of which the service times are exponentially distributed. Units arrive according to a Poisson process and split into two subunits, one joining each queue. Both subunits must complete service before the unit can depart. The author studies the departure process in the steady state and shows by numerical results that it is close to being a Poisson process.
0 references
parallel queues
0 references
departure process
0 references
steady state
0 references
numerical results
0 references
Poisson process
0 references
0.91746974
0 references
0.90566033
0 references
0 references
0.8981023
0 references
0 references
0.88836074
0 references
