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)

    “If thinking is like perceiving, it must be either a process in which the soul is acted upon by what is capable of being thought, or a process different from but analogous to that. The thinking part of the soul must therefore be, while impassable, capable of receiving the form of an object; that is, must be potentially identical in character with its object without being the object. Mind must be related to what is thinkable, as sense is to what is sensible.”
    —Aristotle (384–322 B.C.)