A two-stage queueing system with one server and a buffer of finite capacity in each stage and with a discrete Markov flow of customers is considered. If at the transition moment of a customer to the second stage, the server and all waiting places in the second stage are occupied, this customer is lost. The algorithm to calculate the stationary state probabilities of the number of customers in each stage at an arbitrary discrete time moment is derived. Expressions for loss probabilities are obtained.

Analysis of a two-stage queueing system with a Markov arrival and service processes in discrete time

MANZO, Rosanna;
2005-01-01

Abstract

A two-stage queueing system with one server and a buffer of finite capacity in each stage and with a discrete Markov flow of customers is considered. If at the transition moment of a customer to the second stage, the server and all waiting places in the second stage are occupied, this customer is lost. The algorithm to calculate the stationary state probabilities of the number of customers in each stage at an arbitrary discrete time moment is derived. Expressions for loss probabilities are obtained.
2005
9782915913026
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: https://hdl.handle.net/11386/2501611
 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??? ND
social impact