Clearing models for M/G/1 queues
| Autor(en): | Boxma, OJ Perry, D Stadje, W |
Stichwörter: | clearing; Computer Science; Computer Science, Interdisciplinary Applications; M/G/1 queue; NEGATIVE CUSTOMERS; Operations Research & Management Science; POLLACZEK-KHINTCHINE FORMULA; SYSTEMS; WORK REMOVAL; workload | Erscheinungsdatum: | 2001 | Herausgeber: | KLUWER ACADEMIC PUBL | Journal: | QUEUEING SYSTEMS | Volumen: | 38 | Ausgabe: | 3 | Startseite: | 287 | Seitenende: | 306 | Zusammenfassung: | We consider M/G/1-type queueing systems with `disasters', occurring at certain random times and causing an instantaneous removal of the entire residual workload from the system. After such a clearing, the system is assumed to be ready to start working again immediately. We consider clearings at deterministic equidistant times, at random times and at crossings of some prespecified level, and derive the stationary distribution of the workload process for these clearing times and some of their combinations. |
ISSN: | 02570130 | DOI: | 10.1023/A:1010903605577 |
Show full item record
