ALGORITHMIC COMPUTATION OF THE TRANSIENT QUEUE LENGTH DISTRIBUTION IN THE BMAP/D/c QUEUE

This paper proposes a numerically feasible algorithm for the transient queue length distribution in the BMAP/D/c queue. The proposed algorithm ensures the accuracy of the computational result and it is applicable not only to the stable case but also to the unstable case. This paper also discusses a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the Operations Research Society of Japan 2007, Vol.50(1), pp.55-72
Hauptverfasser:	Daikoku, Kentaro, Masuyama, Hiroyuki, Takine, Tetsuya, Takahashi, Yutaka
Format:	Artikel
Sprache:	eng
Schlagworte:	batch Markovian arrival process (BMAP) BMAP-D-c queue deterministic service multi-server Queue transient queue length distribution
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper proposes a numerically feasible algorithm for the transient queue length distribution in the BMAP/D/c queue. The proposed algorithm ensures the accuracy of the computational result and it is applicable not only to the stable case but also to the unstable case. This paper also discusses a numerical procedure to compute moments of the transient queue length distribution. Finally, some numerical examples are presented to demonstrate the applicability of the proposed algorithm.
ISSN:	0453-4514 2188-8299
DOI:	10.15807/jorsj.50.55