On Block Skip Free Transition Matrices and First Passage Times

Starting from an abstract setting which extends the property “skip free to the left” for transition matrices to a partition of the state space, we develop bounds for the mean hitting time of a Markov chain to an arbitrary subset from an arbitrary initial law. We apply our theory to the embedded Markov chains associated with the M/G/1 and the GI/M/1 queueing systems. We also illustrate its applicability with an asymptotic analysis of a non-reversible Markovian star queueing network with losses.     

Matrix-analytic Models and their Analysis

We survey phase-type distributions and Markovian point processes, aspects of how to use such models in applied probability calculations and how to fit them to observed data. A phase-type distribution is defined as the time to absorption in a finite continuous time Markov process with one absorbing state. This class of distributions is dense and contains many standard examples like all combinations of exponential in series/parallel. A Markovian point process is governed by a finite continuous time Markov process (typically ergodic), such that points are generated at a Poisson intensity depending on the underlying state and at transitions; a main special case is a Markov-modulated Poisson process. In both cases, the analytic formulas typically contain matrix-exponentials, and the matrix formalism carried over when the models are used in applied probability calculations as in problems in renewal theory, random walks and queueing. The statistical analysis is typically based upon the EM algorithm, viewing the whole sample path of the background Markov process as the latent variable.     

Multiple nonlinear regression of the Markovian arrival process for estimating the daily global solar radiation

Abstract

Solar radiation is a global ecological phenomenon that affects life everywhere. In this study, a new statistical method, called the Quartiles-Moment's method, is proposed to estimate the scale and shape parameters of the exponentiated Gumbel maximum distribution (EGMD). The Kolomogorov–Smirnov test and the percentiles of the dataset are thus used to fit the dataset of the daily global solar radiation and the corresponding daily maximum temperature with EGMD. Thence, multiple nonlinear regression of the daily global solar radiation and the corresponding daily maximum temperature are produced and compared with the real dataset accordingly.     

On the coefficient of variation for residence time distributions of some stochastic compartmental models

The study of residence time distributions is motivated by the desire to develop new practical tools for the statistical analysis of compartmental systems. In particular, Gibaldi and Perrier (1982) describe three alternative models for a two-compartment system, which were noted to be "indistinguishable based solely on plasma or urinary excretion data," defining a residence time distribution. In this paper, properties of the coefficient of variation of the residence time distributions are developed for these three models. In addition to the standard Markovian model with exponential retention times, properties are also derived for a non-Markovian model with gamma retention times. A coefficient of variation may be estimated from commonly available elimination data, and may be used in principle to discriminate between these three models.     

A note on Bayesian estimation of traffic intensity in single-server Markovian queues

ABSTRACT

In queuing theory, a major interest of researchers is studying the behavior and formation process and analyzing the performance characteristics of queues, particularly the traffic intensity, which is defined as the ratio between the arrival rate and the service rate. How these parameters can be estimated using some statistical inferential method is the mathematical problem treated here. This article aims to obtain better Bayesian estimates for the traffic intensity of M/M/1 queues, which, in Kendall notation, stand for Markovian single-server infinity queues. The Jeffreys prior is proposed to obtain the posterior and predictive distributions of some parameters of interest. Samples are obtained through simulation and some performance characteristics are analyzed. It is observed from the Bayes factor that Jeffreys prior is competitive, among informative and non-informative prior distributions, and presents the best performance in many of the cases tested.     

Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation

Abstract

We propose a family of finite approximations for the departure process of a BMAP/MAP/1 queue. The departure process approximations are derived via an exact aggregate solution technique (called ETAQA) applied to M/G/1-type Markov processes. The proposed approximations are indexed by a parameter n(n > 1), which determines the size of the output model as n + 1 block levels of the M/G/1-type process. This output approximation preserves exactly the marginal distribution of the true departure process and the lag correlations of the interdeparture times up to lag n ? 2. Experimental results support the applicability of the proposed approximation in traffic-based decomposition of queueing networks.     

基于灰色马尔可夫组合模型的福州港吞吐量预测

灰色马尔可夫组合模型是将灰色预测模型与马尔可夫模型进行组合优化,通过其对福州港2012-2016年货物吞吐量及集装箱吞吐量进行预测,并利用残差模型检验,证明了灰色马尔可夫组合模型能够解决单一模型的局限性、粗糙性和不稳定性问题,预测精度高,符合事物的发展规律,对业界预测港口吞吐量具有实践意义和参考价值。     

Lattice path counting and the theory of queues

In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like M^a/M^b/1$M^a/M^b/1$ systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto–Hahn model or systems with preemptive priorities.