The paper aims at analyzing the BMAP/SM/1/r queueing system for which purpose two techniques are proposed. The first technique is based on the direct solution of the steady-state differential equations of the underlying Markov process. The second one relies on the recurrence relation for calculating the steady-state distributions of the underlying Markov chains for the above queueing system with buffer capacities equal to r,r-1,…,1, respectively.
On The BMAP/SM/1/r Queueing System
D'APICE, Ciro
2001
Abstract
The paper aims at analyzing the BMAP/SM/1/r queueing system for which purpose two techniques are proposed. The first technique is based on the direct solution of the steady-state differential equations of the underlying Markov process. The second one relies on the recurrence relation for calculating the steady-state distributions of the underlying Markov chains for the above queueing system with buffer capacities equal to r,r-1,…,1, respectively.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
