Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Markovian arrival process
open-in-new
<p>In <a href="/facts/Queueing_theory/8NDl56EM">queueing theory</a>, a discipline within the mathematical <a href="/facts/Probability_theory/mFBn51rE">theory of probability</a>, a Markovian arrival process (MAP or MArP) is a mathematical model for the time between job arrivals to a system. The simplest such process is a <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a> where the time between each arrival is <a href="/facts/Exponential_distribution/yY3EdV0u">exponentially distributed</a>. </p><p>The processes were first suggested by <a href="/facts/Marcel_F._Neuts/gx3B3l7d">Marcel F. Neuts</a> in 1979. </p>