Results 111 to 120 of about 5,395,978 (153)
Some of the next articles are maybe not open access.
Construction of continuous time Markovian arrival processes
Journal of Systems Science and Systems Engineering, 2010Markovian arrival processes were introduced by Neuts in 1979 (Neuts 1979) and have been used extensively in the stochastic modeling of queueing, inventory, reliability, risk, and telecommunications systems. In this paper, we introduce a constructive approach to define continuous time Markovian arrival processes.
Qi-Ming He
exaly +2 more sources
The superposition of Markovian arrival processes: moments and the minimal Laplace transform
Annals of Operations ResearchzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sunkyo Kim
exaly +4 more sources
ON MARKOVIAN AND RATIONAL ARRIVAL PROCESSES. I
Informatics and Applications, 2020 This article is the first part of a review carried out within the framework of the RFBR project No. 19-17-50126. The purpose of this review is to get the interested readers familiar with the basics of the theory of Markovian arrival processes to ...
Naumov V.A., Samouylov K.E.
openaire +2 more sources
ON MARKOVIAN AND RATIONAL ARRIVAL PROCESSES. II
Informatics and Applications, 2020 This article is the second part of the review carried out within the framework of the RFBR project No. 19-17-50126. The purpose of this review is to get the interested readers familiar with the basics of the theory of Markovian arrival processes to ...
Naumov V.A., Samouylov K.E.
openaire +2 more sources
Markovian Arrival Processes in Multi-dimensions
2020Phase Type Distributions (PHDs) and Markovian Arrival Processes (MAPs) are established models in computational probability to describe random processes in stochastic models. In this paper we extend MAPs to Multi-Dimensional MAPs (MDMAPs) which are a model for random vectors that may be correlated in different dimensions.
Andreas Blume +2 more
openaire +2 more sources
Local poissonification of the markovian arrival process
Communications in Statistics. Stochastic Models, 1992Summary: In a novel approach to quantifying the burstiness of a stationary point process, the points in successive intervals of length \(a\) are uniformly and independently redistributed over those intervals. As the window size \(a\) is increased, we obtain new point processes which increasingly mimic the local behavior of the Poisson process.
Neuts, Marcel F. +2 more
openaire +1 more source
Descriptors of arrival-process burstiness with application to the discrete Markovian arrival process
Queueing Systems, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mary A. Johnson, Surya Narayana
openaire +1 more source
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
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
Double-sided queues with marked Markovian arrival processes and abandonment
Stochastic Models, 2021 In this paper, we study a double-sided queueing model with marked Markovian arrival processes and finite discrete abandonment times. We apply the theory of multi-layer Markov modulated fluid flow (MMFF) processes to analyze the queueing model.
Qi-Ming He
exaly +1 more source
Parallelization of EM-Algorithms for Markovian Arrival Processes
2020Markovian 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 +2 more
openaire +2 more sources