Efficient computational analysis of stationary probabilities for the queueing system BMAP/G/1/N with or without vacation(s)
A. D. Banik, M. L. Chaudhry
| Year of publication: |
2017
|
|---|---|
| Authors: | Banik, A. D. ; Chaudhry, M. L. |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 29.2017, 1, p. 140-151
|
| Subject: | finite-buffer queue | batch Markovian arrival process | single server | partial batch rejection policy | single- and multiple-vacation policy | Pareto service time distribution | Warteschlangentheorie | Queueing theory | Markov-Kette | Markov chain | Wahrscheinlichkeitsrechnung | Probability theory | Stochastischer Prozess | Stochastic process |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2016.0720 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011648543