Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCorrected phase-type approximations for the workload of the MAP/G/1 queue with heavy-tailed service times
109
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In many applications, significant correlations between arrivals of load-generating events make the numerical evaluation of the load of a system a challenging problem. Here, we construct very accurate approximations of the workload distribution of the MAP/G/1 queue that capture the tail behavior of the exact workload distribution and provide a small relative error. Motivated by statistical analysis, we assume that the service times are a mixture of a phase-type and a heavy-tailed distribution. With the aid of perturbation analysis, we derive our approximations as a sum of the workload distribution of the MAP/PH/1 queue and a heavy-tailed component that depends on the perturbation parameter. We refer to our approximations as corrected phase-type approximations, and we exhibit their performance with a numerical study.
rate research
Read More
Numerical evaluation of performance measures in heavy-tailed risk models is an important and challenging problem. In this paper, we construct very accurate approximations of such performance measures that provide small absolute and relative errors. Motivated by statistical analysis, we assume that the claim sizes are a mixture of a phase-type and a heavy-tailed distribution and with the aid of perturbation analysis we derive a series expansion for the performance measure under consideration. Our proposed approximations consist of the first two terms of this series expansion, where the first term is a phase-type approximation of our measure. We refer to our approximations collectively as corrected phase-type approximations. We show that the corrected phase-type approximations exhibit a nice behavior both in finite and infinite time horizon, and we check their accuracy through numerical experiments.
We develop accurate approximations of the delay distribution of the MArP/G/1 queue that cap- ture the exact tail behavior and provide bounded relative errors. Motivated by statistical analysis, we consider the service times as a mixture of a phase-type and a heavy-tailed distribution. With the aid of perturbation analysis, we derive corrected phase-type approximations as a sum of the delay in an MArP/PH/1 queue and a heavy-tailed component depending on the perturbation parameter. We exhibit their performance with numerical examples.
Significant correlations between arrivals of load-generating events make the numerical evaluation of the workload of a system a challenging problem. In this paper, we construct highly accurate approximations of the workload distribution of the MAP/G/1 queue that capture the tail behavior of the exact workload distribution and provide a bounded relative error. Motivated by statistical analysis, we consider the service times as a mixture of a phase-type and a heavy-tailed distribution. With the aid of perturbation analysis, we derive our approximations as a sum of the workload distribution of the MAP/PH/1 queue and a heavy-tailed component that depends on the perturbation parameter. We refer to our approximations as corrected phase-type approximations, and we exhibit their performance with a numerical study.
Numerical evaluation of ruin probabilities in the classical risk model is an important problem. If claim sizes are heavy-tailed, then such evaluations are challenging. To overcome this, an attractive way is to approximate the claim sizes with a phase-type distribution. What is not clear though is how many phases are enough in order to achieve a specific accuracy in the approximation of the ruin probability. The goals of this paper are to investigate the number of phases required so that we can achieve a pre-specified accuracy for the ruin probability and to provide error bounds. Also, in the special case of a completely monotone claim size distribution we develop an algorithm to estimate the ruin probability by approximating the excess claim size distribution with a hyperexponential one. Finally, we compare our approximation with the heavy traffic and heavy tail approximations.
We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the service times depend on the previous preparation time through their joint Laplace transform. The waiting time process is directly analysed by solving a Lindley-type equation via transform methods. Numerical examples are included to demonstrate the effect of the autocorrelation of and the cross-correlation between the preparation and service times.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
