Analysis of G/D/1 Queueing Systems with Inputs Satisfying Large Deviation Principle under Weak* Topology

The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak^* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP.     

Time dependent analysis of finite buffer fluid flows and risk models with a dividend barrier

Based on the matrix-analytic approach to fluid flows initiated by Ramaswami, we develop an efficient time dependent analysis for a general Markov modulated fluid flow model with a finite buffer and an arbitrary initial fluid level at time 0. We also apply this to an insurance risk model with a dividend barrier and a general Markovian arrival process of claims with possible dependencies in successive inter-claim intervals and in claim sizes. We demonstrate the implementability and accuracy of our algorithms through a set of numerical examples that could also serve as test cases for comparing other solution approaches.      

On the analysis of the Gerber-Shiu discounted penalty function for risk processes with Markovian arrivals

In this paper, we consider an insurance risk model governed by a Markovian arrival claim process and by phase-type distributed claim amounts, which also allows for claim sizes to be correlated with the inter-claim times. A defective renewal equation of matrix form is derived for the Gerber-Shiu discounted penalty function and solved using matrix analytic methods. The use of the busy period distribution for the canonical fluid flow model is a key factor in our analysis, allowing us to obtain an explicit form of the Gerber-Shiu discounted penalty function avoiding thus the use of Lundberg’s fundamental equation roots. As a special case, we derive the triple Laplace transform of the time to ruin, surplus prior to ruin, and deficit at ruin in explicit form, further obtaining the discounted joint and marginal moments of the surplus prior to ruin and the deficit at ruin.     

A MAP-modulated fluid flow model with multiple vacations

We consider a MAP-modulated fluid flow queueing model with multiple vacations. As soon as the fluid level reaches zero, the server leaves for repeated vacations of random length V until the server finds any fluid in the system. During the vacation period, fluid arrives from outside according to the MAP (Markovian Arrival Process) and the fluid level increases vertically at the arrival instance. We first derive the vector Laplace–Stieltjes transform (LST) of the fluid level at an arbitrary point of time in steady-state and show that the vector LST is decomposed into two parts, one of which the vector LST of the fluid level at an arbitrary point of time during the idle period. Then we present a recursive moments formula and numerical examples.     

Steady State Analysis of Finite Fluid Flow Models Using Finite QBDs

The Markov modulated fluid model with finite buffer of size β is analyzed using a stochastic discretization yielding a sequence of finite waiting room queueing models with iid amounts of work distributed as exp (nλ). The n-th approximating queue’s system size is bounded at a value q_n such that the corresponding expected amount of work q_n/(nλ) → β as n → ∞. We demonstrate that as n → ∞, we obtain the exact performance results for the finite buffer fluid model from the processes of work in the system for these queues. The necessary (strong) limit theorems are proven for both transient and steady state results. Algorithms for steady state results are developed fully and illustrated with numerical examples.AMS subject classification: 60J25, 60K25, 60K15, 60K37This revised version was published online in June 2005 with corrected coverdate     

A factorization property for BMAP/G/1 vacation queues under variable service speed

This paper proposes a simple factorization principle that can be used efficiently and effectively to derive the vector generating function of the queue length at an arbitrary time of the BMAP/G/1/ queueing systems under variable service speed. We first prove the factorization property. Then we provide moments formula. Lastly we present some applications of the factorization principle.