The M/G/1 queue with finite workload capacity
Autor(en): | Perry, D Stadje, W Zacks, S |
Stichwörter: | busy period; Computer Science; Computer Science, Interdisciplinary Applications; finite capacity; M/D/1; M/G/1queue; Operations Research & Management Science; restricted access; stationary distribution; workload | Erscheinungsdatum: | 2001 | Herausgeber: | KLUWER ACADEMIC PUBL | Journal: | QUEUEING SYSTEMS | Volumen: | 39 | Ausgabe: | 1 | Startseite: | 7 | Seitenende: | 22 | Zusammenfassung: | We consider the M/G/1 queueing system in which customers whose admission to the system would increase the workload beyond a prespecified finite capacity limit are not accepted. Various results on the distribution of the workload are derived; in particular, we give explicit formulas for its stationary distribution for M/M/1 and in the general case, under the preemptive LIFO discipline, for the joint stationary distribution of the number of customers in the system and their residual service times. Furthermore, the Laplace transform of the length of a busy period is determined. Finally, for M/D/1 the busy period distribution is derived in closed form. |
ISSN: | 02570130 | DOI: | 10.1023/A:1017931515538 |
Show full item record