수 04 5월 2016

Q. Consider a system which has one server and can accommodate at most \(K\) customers including the customer in the server. The time is divided into time slots with fixed length. The server can start its server only at the beginning of a time slot and the service time of a customer is one time slot. The probability that \(i\) customers arrive at the system during a time slot is given as \(P_i\), and the arriving customers that cannot be accommodated in the system are lost. Derive the state transition probability diagram of this discrete time Markov chain.

A.

Category: quiz Tagged: system analysis quiz markov chain transition probability diagram