The M/M/c with critical jobs |
| |
| Authors: | Ivo Adan Gerard Hooghiemstra |
| |
| Affiliation: | (1) Department of Mathematics and Computing Science, Eindhoven University of Technology, Box 513, 5600 MB Eindhoven, The Netherlands;(2) Department of Mathematics and Informatics, Delft University of Technology, Box 356, 2600 AJ Delft, The Netherlands |
| |
| Abstract: | We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach. |
| |
| Keywords: | M/M/c priority queue bounds matrix methods |
| 本文献已被 SpringerLink 等数据库收录！ |
|
