Markovian Arrival Processes - Poisson Process

Poisson Process

The Poisson arrival process or Poisson process counts the number of arrivals, each of which has an exponentially distributed time between arrival. In the most general case this can be represented by the rate matrix,


Q=\left[\begin{matrix}
-\lambda_{0}&\lambda_{0}&0&0&\dots\\
0&-\lambda_{1}&\lambda_{1}&0&\dots\\
0&0&-\lambda_{2}&\lambda_{2}&\dots\\
\vdots & \vdots & \ddots & \ddots & \ddots
\end{matrix}\right]\; .

In the homogeneous case this is more simply,


Q=\left[\begin{matrix}
-\lambda&\lambda&0&0&\dots\\
0&-\lambda&\lambda&0&\dots\\
0&0&-\lambda&\lambda&\dots\\
\vdots & \vdots & \ddots & \ddots & \ddots
\end{matrix}\right]\; .

Here every transition is marked.

Read more about this topic:  Markovian Arrival Processes

Famous quotes containing the word process:

    I wish to see, in process of disappearing, that only thing which ever could bring this nation to civil war.
    Abraham Lincoln (1809–1865)