The single-server exponential queueing system without the buffer and with a fixed number, m, of retrials is considered. The aim of the paper is to analyze this queueing model. An approach based on the concept of recurrent relationship between the steady-state distribution of the underlying Markov process and the number of retrials m, m-1,…,1 is proposed. A recurrent algorithm to calculate the steady-state distribution is constructed. On the basis of this algorithm, the mean queue length of retrial customers and some other important system efficiency measures can be calculated.

On the Single-Server Queueing System with Fixed Number of Retrials

D'APICE, Ciro;SALERNO, Saverio
2001

Abstract

The single-server exponential queueing system without the buffer and with a fixed number, m, of retrials is considered. The aim of the paper is to analyze this queueing model. An approach based on the concept of recurrent relationship between the steady-state distribution of the underlying Markov process and the number of retrials m, m-1,…,1 is proposed. A recurrent algorithm to calculate the steady-state distribution is constructed. On the basis of this algorithm, the mean queue length of retrial customers and some other important system efficiency measures can be calculated.
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11386/1846197
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 1
social impact