Question

1. (35 points) Consider this variation of the telecommunication problem. Each of the c transmission channels has a probability of p 0.7 of being in working condition during each clock time independently of all previous clock times. Also assume that each message not transmitted at the beginning of 0.1 of being lost during the period. The a clock time has probability a events at the end of each time period happens in the following order: first messages are transmitted, then some messages may be deleted and finally the number of messages in the new messages are received. We define X as buffer during clock time n. (b) Define all the random variables in this problem. (b) Express Xn+1 in terms of Xn. Is Xn discrete state or continuous state? (c) Is this stochastic process a Markov chain? Why? is it discrete time or continuous time? (d) Suppose N = 3 and c trix (tpm). 2, construct the transition probability ma- 1

Answer 1

PAGE NO.: DATE his is tte vanatianof telecommuniadio that each of c trarsmission channels ha Pababilidy pao.7 of beingin 2exking condithion durning each dock tineindep problemf hen vaniables in this problem oumbe af messagesn the buffer duming a) Random The clock time dozkingcondichion time ndependentyaf alpreniaus clade Himes each dock att the end af cach time The evends XA peniad The numberof messages in the buffear dumng dack time discrete state FAarkov stochastic prncess Hime stochastk pacess Apeces Yes, This PYores discrete is