Abstract
This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic control of the D-policy and multiple server vacations. We derive the probability generating function of the queue length and the mean queue length. We then present computational experiences and compare the MAP queue with the Poisson queue.
Original language | English |
---|---|
Pages (from-to) | 537-562 |
Number of pages | 26 |
Journal | Discrete Event Dynamic Systems: Theory and Applications |
Volume | 18 |
Issue number | 4 |
DOIs | |
State | Published - Dec 2008 |
Keywords
- Dyadic control
- MAP/G/1 queue
- Workload and server idleness