Markovian Arrival Processes - Batch Markov Arrival Process

Batch Markov Arrival Process

The batch Markovian arrival process (BMAP) is a generalisation of the Markovian arrival process by having arrivals of size greater than one. The homogeneous case has rate matrix,

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

An arrival of size occurs every time a transition occurs in the sub-matrix . Sub-matrices have elements of, the rate of a Poisson process, such that,

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

and

\sum^{\infty}_{k=0}D_{k}\boldsymbol{1}=\boldsymbol{0}

Read more about this topic:  Markovian Arrival Processes

Famous quotes containing the words batch, arrival and/or process:

    “Do you not know that a little yeast leavens the whole batch of dough?”
    —Bible: New Testament, 1 Corinthians 5:6.

    “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)

    “Every modern male has, lying at the bottom of his psyche, a large, primitive being covered with hair down to his feet. Making contact with this Wild Man is the step the Eighties male or the Nineties male has yet to take. That bucketing-out process has yet to begin in our contemporary culture.”
    —Robert Bly (b. 1926)