Results 191 to 200 of about 1,619 (228)

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

Spatial Markovian Arrival Processes

2003
The recent rise of mobile communication systems gave reason to the development of queueing models which are capable of incorporating spatial features. Introducing spatial arrival processes is of great help for modelling mobile communication networks, since users of such networks can be characterized more adequately by properties depending on their ...
openaire   +1 more source

Estimating Computer Virus Propagation Based on Markovian Arrival Processes

2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing, 2010
This paper refines statistical inference of computer virus propagation with maximum likelihood (ML) estimation. In particular, in order to utilize actual infection data that are opened in Web sites, we reformulate classical stochastic models by Markovian arrival processes (MAPs).
Hiroyuki Okamura, Tadashi Dohi
openaire   +1 more source

Stochastic models of space priority mechanisms with Markovian arrival processes

Annals of Operations Research, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jorge García, Olga Casals
openaire   +1 more source

Faster Maximum Likelihood Estimation Algorithms for Markovian Arrival Processes

2009 Sixth International Conference on the Quantitative Evaluation of Systems, 2009
This paper proposes two improvements of fitting algorithms for Markovian arrival processes (MAPs). The first improvement is to enhance the computation speed of Ryd\'en's EM algorithm (1996) for estimating MAP parameters. The second one is to provide an efficient sub-class of MAPs to be appropriate for fitting to real traffic data.
Hiroyuki Okamura, Tadashi Dohi
openaire   +1 more source