Results 171 to 180 of about 10,720,791 (210)

Descriptors of arrival-process burstiness with application to the discrete Markovian arrival process

Queueing Systems, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mary A. Johnson, Surya Narayana
openaire   +1 more source

Markovian Arrival Processes

2014
PHDs can be extended to describe correlated inter-event times. The resulting models are denoted as Markovian Arrival Processes (MAPs) and have been introduced in the pioneering work of Neuts [124]. MAPs are a very flexible and general class of stochastic processes. In this chapter we first introduce the general model and its analysis, then the specific
Peter Buchholz, Jan Kriege, Iryna Felko
openaire   +1 more source

Parallelization of EM-Algorithms for Markovian Arrival Processes

2020
Markovian Arrival Processes (MAPs) are widely used stochastic models to describe correlated events. For the parameter fitting of MAPs according to measured data, the expectation-maximization (EM) algorithm is commonly seen as the best approach. Unfortunately, EM algorithms require a huge computational effort if the number of data points is large or the
Andreas Blume, Peter Buchholz 0001, Jan Kriege   +2 more
openaire   +2 more sources

A Tandem Queue with Blocking and Markovian Arrival Process

Queueing Systems, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Time Reversal of Markovian Arrival Processes

Stochastic Models, 2004
Abstract We study the point process obtained by reversing time in a stationary Markovian Arrival Process (MAP). That process is also a MAP. We show that the most frequently used classical statistical descriptors of point processes are insensitive to the orientation of the time-axis. Therefore they fail to distinguish between a MAP and its reverse. That
Allan T. Andersen, Marcel F. Neuts, Bo Friis Nielsen   +2 more
openaire   +1 more source

Joint arrival process of multiple independent batch Markovian arrival processes

Statistics & Probability Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianyu Cao, Weixin Xie
openaire   +1 more source

Burstiness descriptors for markov renewal processes and markovian arrival processes

Communications in Statistics. Stochastic Models, 1997
Summary: Quantitative descriptors of the burstiness of an arrival process are derived for Markov renewal processes (MRP's) and Markovian arrival processes (MAP's). Our burstiness descriptors are based on simple definitions of a burst and a gap in an arrival process.
Johnson, Mary A., Liu, Danielle, Narayana, Surya   +2 more
openaire   +2 more sources

Packet Loss Process in a Queue with Markovian Arrivals

Seventh International Conference on Networking (icn 2008), 2008
In this report, a detailed analysis of the packet loss process in a finite-buffer queue fed by the Markovian arrival process (MAP) is shown. The results consist of both transient and stationary characterization of the loss process in terms of the loss ratio, the number of packets lost per time unit and the number of losses in an interval of a given ...
openaire   +1 more source

Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process

Queueing Systems, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Attahiru Sule Alfa, Jungong Xue, Qiang Ye 0003   +2 more
openaire   +2 more sources

Examples of Markovian Arrival Processes

2003
The present chapter provides two important examples for Markovian arrival processes. In contrast to the top-down approach in chapter 2, where arrival processes have been introduced from a very general point of view, the following presentation shall provide some intuition into the common features of different specifications of MAPs.
openaire   +1 more source