On the absolute ruin problem in a Sparre Andersen risk model with constant interest

In this paper, we extend the work of Mitric and Sendova (2010), which considered the absolute ruin problem in a risk model with debit and credit interest, to renewal and non-renewal structures. Our first results apply to MAP processes, which we later restrict to the Sparre Andersen renewal risk model with interclaim times that are generalized Erlang (n) distributed and claim amounts following a Matrix-Exponential (ME) distribution (see for e.g. Asmussen and O’Cinneide (1997)). Under this scenario, we present a general methodology to analyze the Gerber-Shiu discounted penalty function defined at absolute ruin, as a solution of high-order linear differential equations with non-constant coefficients. Closed-form solutions for some absolute ruin related quantities in the generalized Erlang (2) case complement the results obtained under the classical risk model by Mitric and Sendova (2010).     

A server backup model with Markovian arrivals and phase type services

We consider a finite capacity queueing system with one main server who is supported by a backup server. We assume Markovian arrivals, phase type services, and a threshold-type server backup policy with two pre-determined lower and upper thresholds. A request for a backup server is made whenever the buffer size (number of customers in the queue) hits the upper threshold and the backup server is released from the system when the buffer size drops to the lower threshold or fewer at a service completion of the backup server. The request time for the backup server is assumed to be exponentially distributed. For this queuing model we perform the steady state analysis and derive a number of performance measures. We show that the busy periods of the main and backup servers, the waiting times in the queue and in the system, are of phase type. We develop a cost model to obtain the optimal threshold values and study the impact of fixed and variable costs for the backup server on the optimal server backup decisions. We show that the impact of standard deviations of the interarrival and service time distributions on the server backup decisions is quite different for small and large values of the arrival rates. In addition, the pattern of use of the backup server is very different when the arrivals are positively correlated compared to mutually independent arrivals.     

Maintenance of a deteriorating single server system with Markovian arrivals and random shocks

We consider a single server queue in which the arrivals occur according to a Markovian arrival process. The system is subject to external shocks causing the server to deteriorate and possibly fail. The maintenance of the server is provided either as a preventive one or for a complete failure so as to bring back to normal. Under the assumptions of Poisson shocks, exponential services and exponential maintenance with rates depending on the state of the server, and a general (discrete) probability distribution for the intensity of the shocks, the model is analyzed in steady-state. Some interesting theoretical results along with a few illustrative numerical examples are reported. An optimization problem involving various costs is studied numerically.     

A disaster queue with Markovian arrivals and impatient customers

We consider a single server queueing system in which arrivals occur according to a Markovian arrival process. The system is subject to disastrous failures at which times all customers in the system are lost. Arrivals occurring during the time the system undergoes repair are stored in a buffer of finite capacity. These customers can become impatient after waiting a random amount of time and leave the system. However, these customers do not become impatient once the system becomes operable. When the system is operable, there is no limit on the number of customers who can be admitted. The structure of this queueing model is of GI/M/1-type that has been extensively studied by Neuts and others. The model is analyzed in steady state by exploiting the special nature of this type queueing model. A number of useful performance measures along with some illustrative examples are reported.     

A generalized penalty function with the maximum surplus prior to ruin in a MAP risk model

In this paper, a risk model where claims arrive according to a Markovian arrival process (MAP) is considered. A generalization of the well-known Gerber-Shiu function is proposed by incorporating the maximum surplus level before ruin into the penalty function. For this wider class of penalty functions, we show that the generalized Gerber-Shiu function can be expressed in terms of the original Gerber-Shiu function (see e.g. [Gerber, Hans U., Shiu, Elias, S.W., 1998. On the time value of ruin. North American Actuarial Journal 2(1), 48-72]) and the Laplace transform of a first passage time which are both readily available. The generalized Gerber-Shiu function is also shown to be closely related to the original Gerber-Shiu function in the same MAP risk model subject to a dividend barrier strategy. The simplest case of a MAP risk model, namely the classical compound Poisson risk model, will be studied in more detail. In particular, the discounted joint density of the surplus prior to ruin, the deficit at ruin and the maximum surplus before ruin is obtained through analytic Laplace transform inversion of a specific generalized Gerber-Shiu function. Numerical illustrations are then examined.     

Analysis of a Discrete-Time Queueing System with a Single Server and Heterogeneous Markovian Arrivals

We consider a discrete-time queueing system with a single deterministic server, heterogeneous Markovian arrivals and finite capacity. Most existing techniques model the queueing system using a direct bivariate Markov chain which requires a state space that grows rapidly as the number of customer types increases. In this paper, we define renewal cycles in terms of the input process and model the system occupancy level on each renewal cycle using a one-dimensional Markov chain. We derive the exact joint steady-state probability distribution of both states of input and system occupancy with a considerably reduced state space, which leads to the efficient calculation of overall/individual performance measures such as loss probability and average delay.     

Threshold control by a single-server retrial queue with batch arrivals and group services

A controlled single-server retrial queueing system is investigated. Customers arrive according to batch Markovian arrival process. The system has several operation modes which are controlled by means of a threshold strategy. The stationary distribution is calculated. Optimization problem is considered and a numerical example is presented.     

On the Counting Process for a Class of Markovian Arrival Processes with an Application to a Queueing System

In this paper, we consider the counting process for a class of Markovian arrival processes (MAPs). We assume that the representing matrices in such MAPs are expanded in terms of matrix representations of the standard generators in the Lie algebra of the special linear group. The primary purpose of this paper is to construct an explicit solution of the time-dependent distribution and factorial moments of the number of arrival events in (0,t] of the counting process for this class of MAPs. Our construction relies on the Baker–Hausdorff lemma and the specific structure of the representing matrices. To investigate the efficiency of CPU usage with the explicit solution, we have conducted numerical experiments on computing the time-dependent distribution of the counting process through the explicit solution and uniformization-based method. We show that the CPU times required to compute the time-dependent distribution of the number of arrival events in (0,t] through the explicit solution have little sensitivity to t, while the consumption of CPU times with the uniformization-based method becomes greater as t increases. For illustrative purposes, we present a system performance analysis of a queueing system for possible use in automatic call distribution (ACD) systems. As an application of the explicit solution, we use it to express the waiting time distribution of the queueing system. Some numerical examples are also given with comparisons to computer simulations.AMS subject classification: 60K20, 60K25, 68M20This revised version was published online in June 2005 with corrected coverdate     

A maintenance model with failures and inspection following Markovian arrival processes and two repair modes

We consider a deteriorating system submitted to external and internal failures, whose deterioration level is known by means of inspections. There are two types of repairs: minimal and perfect, depending on the deterioration level, each one following a different phase-type distribution. The failures and the inspections follow different Markovian arrival processes (MAP). Under these assumptions, the system is governed by a generalized Markov process, whose state space and generator are constructed. This general model includes the phase-type renewal process as a special case. The distribution of the number of minimal and perfect repairs between two inspections are determined. A numerical application optimizing costs is performed, and different particular cases of the model are compared.     

A Tandem Queue with Blocking and Markovian Arrival Process

Queueing networks with blocking have proved useful in modelling of data communications and production lines. We study such a network consisting of a sequence of two service stations with an infinite queue allowed before the first station and no intermediate queue allowed between them. This restriction results in the blocking of the first station whenever a unit having completed its service in that station cannot enter into the second one due to the presence of another unit there. The input of units to the network is the MAP (Markovian Arrival Process). At the first station, service requirements are of phase type whereas service times at the second station are arbitrarily distributed. The focus is on the embedded process at departures. The essential tool in our analysis is the general theory on Markov renewal processes of M/G/1-type.     

On the Markov-dependent risk model with tax

In this paper we consider the Markov-dependent risk model with tax payments in which the claim occurrence, the claim amount as well as the tax rate are controlled by an irreducible discrete-time Markov chainSystems of integro-differential equations satisfied by the expected discounted tax payments and the non-ruin probability in terms of the ruin probabilities under the Markov-dependent risk model without tax are establishedThe analytical solutions of the systems of integro-differential equations are also obtained by the iteration method.     

On the renewal risk model with interest and dividend

We consider that the reserve of an insurance company follows a renewal risk process with interest and dividend. For this risk process, we derive integral equations and exact infinite series expressions for the Gerber-Shiu discounted penalty function. Then we give lower and upper bounds for the ruin probability. Finally, we present exact expressions for the ruin probability in a special case of renewal risk processes.     

On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N

We consider a finite-buffer single-server queue with renewal input where the service is provided in batches of random size according to batch Markovian service process (BMSP). Steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs have been obtained along with some important performance measures. The model has potential applications in the areas of computer networks, telecommunication systems, and manufacturing systems, etc.      

Finite buffer vacation models under E-limited with limit variation service and Markovian arrival process

We consider a finite-buffer single server queue with single (multiple) vacation(s) and Markovian arrival process. The service discipline is E-limited with limit variation (ELV). Several other service disciplines like, Bernoulli scheduling, nonexhaustive and E-limited service can be treated as special cases of the ELV service.     

A Markovian canonical form of second-order matrix-exponential processes

Besides the fact that – by definition – matrix-exponential processes (MEPs) are more general than Markovian arrival processes (MAPs), only very little is known about the precise relationship of these processes in matrix notation. For the first time, this paper proves the persistent conjecture that – in two dimensions – the respective sets, MAP(2) and MEP(2), are indeed identical with respect to the stationary behavior. Furthermore, this equivalence extends to acyclic MAPs, i.e., AMAP(2), so that AMAP(2)≡MAP(2)≡MEP(2)$\mathrm{AMAP}(2)\equiv \mathrm{MAP}(2)\equiv \mathrm{MEP}(2)$. For higher orders, these equivalences do not hold.     

On a compound Poisson risk model with delayed claims and random incomes

The main focus of this paper is to analyze the Gerber-Shiu penalty function of a compound Poisson risk model with delayed claims and random incomes. It is assumed that every main claim will produce a by-claim which can be delayed with a certain probability. We derive the integral equation satisfied by the Gerber-Shiu penalty function. Given that the premium size is exponentially distributed, the explicit expression for the Laplace transform of the Gerber-Shiu penalty function is derived. Finally, when the premium sizes have rational Laplace transforms, we also obtain the Laplace transform of the Gerber-Shiu penalty function.     

The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process

We consider an infinite-buffer single server queue where arrivals occur according to a batch Markovian arrival process (BMAP). The server serves until system emptied and after that server takes a vacation. The server will take a maximum number H of vacations until either he finds at least one customer in the queue or the server has exhaustively taken all the vacations. We obtain queue length distributions at various epochs such as, service completion/vacation termination, pre-arrival, arbitrary, departure, etc. Some important performance measures, like mean queue lengths and mean waiting times, etc. have been obtained. Several other vacation queueing models like, single and multiple vacation model, queues with exceptional first vacation time, etc. can be considered as special cases of our model.     

BMAP/G/1 queue with correlated arrivals of customers and disasters

We consider a single server queue with disasters where the arrivals of customers and disasters are correlated. When a disaster occurs, it removes all the customers in the system and there requires repair time for the system to be operated normally. The stationary queue length distribution at the embedded points and at an arbitrary time are presented.     

Response time in a tandem queue with blocking, Markovian arrivals and phase-type services

A novel approach for obtaining the response time in a discrete-time tandem-queue with blocking is presented. The approach constructs a Markov chain based on the age of the leading customer in the first queue. We also provide a stability condition and carry out several numerical examples.     

一类马氏过程在作战分析中的应用

本文应用随机过程的理论和方法定义了一类特殊的作战过程——纯灭战斗过程,研究并导出了该战斗过程的作战实力转移特征等．