This paper will be concerned with a two-phase queueing system consisting of two single servers in tandem with a Markov arrival process. Each server has a finite buffer. An arriving customer who finds the first buffer full is lost. Customers in each phase are served in order of their arrival. The analysis of the described tandem queue involves the construction of a Markov chain embedded at the transition moments of the customers from the first phase to the second one, and we have obtained Based on the stationary distribution of this chain and using notions of renewal theory, we have derived the stationary distributions of the number of customers in each phase at an arbitrary time moment.
Two-phase queueing system with a Markov arrival process and blocking
MANZO, Rosanna;
2006-01-01
Abstract
This paper will be concerned with a two-phase queueing system consisting of two single servers in tandem with a Markov arrival process. Each server has a finite buffer. An arriving customer who finds the first buffer full is lost. Customers in each phase are served in order of their arrival. The analysis of the described tandem queue involves the construction of a Markov chain embedded at the transition moments of the customers from the first phase to the second one, and we have obtained Based on the stationary distribution of this chain and using notions of renewal theory, we have derived the stationary distributions of the number of customers in each phase at an arbitrary time moment.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
