• Markov Processes

• Birth & Death queueing model

• Block Diagram and explanation of single and multiple server queuing system

• M/M/1/$\infty$ queueing system

**Mumbai University > Electronics and Telecommunication Engineering > Sem 5 > Random Signal Analysis

Marks: 10M

Year: May 2016

• Markov Processes

The stochastic process X(t) is referred to as a Markov Process if it satisfies the Markovian Property (i.e. memoryless property). This states that -

P{X(tn+1)=xn+1 | X(tn)=xn ...... X(t1)=x1} = P{X(tn+1)=xn+1 | X(tn)=xn}

for any choice of time instants ti , i =1,……, n where tj > tk …