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:

    “For the poet the credo or doctrine is not the point of arrival but is, on the contrary, the point of departure for the metaphysical journey.”
    —Joseph Brodsky (b. 1940)

    “When you start with a portrait and search for a pure form, a clear volume, through successive eliminations, you arrive inevitably at the egg. Likewise, starting with the egg and following the same process in reverse, one finishes with the portrait.”
    —Pablo Picasso (1881–1973)