On the departure process of the split and match queue
From MaRDI portal
(Redirected from Publication:915291)
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.
Recommendations
- Departure process of the MAP/SM/1 queue
- The departure process for the M/M/1 queue
- Departure process in tandem queues
- The departure process from the GI/G/1 Queue
- Departure processes of BMAP/G/1 queues
- scientific article; zbMATH DE number 3938210
- The Departure Process for Queueing Systems with Batch Arrival of Customers
- Algorithmic and approzimation analyses of the split and match queue
Cites work
- Algorithmic and approzimation analyses of the split and match queue
- scientific article; zbMATH DE number 3942860 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- On the output process of an M/M/1 queue with randomly varying system parameters
- Two Parallel Queues Created by Arrivals with Two Demands I
Cited in
(5)
This page was built for publication: On the departure process of the split and match queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915291)