Abstract
In this paper, we consider a discrete time Geom/Geom/1 queue system with (N; n)-preemptive priority discipline and multiple synchronization working vacation. A discrete time three-dimension Markov chain (MC) of this queue system is given. By using the quasi birth and death chain and matrix-geometric solution theory, the average queue length of the two classes and the probability of a customer I being preempted are obtained. In the end, some numerical and optimization results are provided to illustrate the effect of the parameters on several performance characteristics.
| Original language | English |
|---|---|
| Pages (from-to) | 2735-2741 |
| Number of pages | 7 |
| Journal | ICIC Express Letters |
| Volume | 10 |
| Issue number | 11 |
| State | Published - 2016 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2016 ICIC International.
Keywords
- Matrix-geometric solution
- Optimization
- Preemptive priority
- Quasi birth and death chain
- Threshold