Markovian Arrival Processes - Markov Arrival Process

The Markov arrival process (MAP) is a generalization of the Poisson process by having non-exponential distribution sojourn between arrivals. The homogeneous case has rate matrix,

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

An arrival is seen every time a transition occurs that increases the level (a marked transition), e.g. a transition in the sub-matrix. Sub-matrices and have elements of, the rate of a Poisson process, such that,

0\leq _{i,j}<\infty
0\leq _{i,j}<\infty\;\;\;\; i\neq j
_{i,i}<0\;

and

(D_{0}+D_{1})\boldsymbol{1}=\boldsymbol{0}

There are several special cases of the Markov arrival process.

Read more about this topic:  Markovian Arrival Processes

Famous quotes containing the words arrival and/or process:

    “National literature does not mean much these days; now is the age of world literature, and every one must contribute to hasten the arrival of that age.”
    —Johann Wolfgang Von Goethe (1749–1832)

    “The a priori method is distinguished for its comfortable conclusions. It is the nature of the process to adopt whatever belief we are inclined to, and there are certain flatteries to the vanity of man which we all believe by nature, until we are awakened from our pleasing dream by rough facts.”
    —Charles Sanders Peirce (1839–1914)