Related papers: Exact tail asymptotics for a discrete-time preempt…
Let $\eta_1$, $\eta_2,\ldots$ be independent copies of a random variable $\eta$ with zero mean and finite variance which is bounded from the right, that is, $\eta\leq b$ almost surely for some $b>0$. Considering different types of the…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
We establish sharp tail asymptotics for component-wise extreme values of bivariate Gaussian random vectors with arbitrary correlation between the components. We consider two scaling regimes for the tail event in which we demonstrate the…
We consider sojourn (or response) times in processor-shared queues that have a finite customer capacity. Computing the response time of a tagged customer involves solving a finite system of linear ODEs. Writing the system in matrix form, we…
A two-sided matching system is considered, where servers are assumed to arrive at a fixed rate, while the arrival rate of customers is modulated via a price-control mechanism. We analyse a loss model, wherein customers who are not served…
This paper investigates the asymptotic behavior of higher-order conditional tail moments, which quantify the contribution of individual losses in the event of systemic collapse. The study is conducted within a framework comprising two…
The main target of this paper is to present the Markov chain C that, not giving explicitly the queue lengths stationary probabilities, has the necessary information to its determination for open networks of queues with several classes of…
We study a token-based central queue with multiple customer types. Customers of each type arrive according to a Poisson process and have an associated set of compatible tokens. Customers may only receive service when they have claimed a…
In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…
We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the…
A network belongs to the monotone separable class if its state variables are homogeneous and monotone functions of the epochs of the arrival process. This framework, which was first introduced to derive the stability region for stochastic…
The areas under workload process and under queuing process in a single server queue over the busy period have many applications not only in queuing theory but also in risk theory or percolation theory. We focus here on the tail behaviour of…
In this paper, asymptotic behavior of convolution of distributions belonging to two subclasses of distributions with exponential tails are considered, respectively. The precise second-order tail asymptotics of the convolutions are derived…
A special customer must complete service from two servers in series, in either order, each with an M/M/1 queueing system. It is assumed that the two queueing system lengths are independent with initial numbers of customers a and b at the…
This paper investigates the second order asymptotic expansion for tail probabilities of discounted aggregate claims in continuous-time renewal risk models with constant interest force. Concretely, two types of continuous-time renewal risk…
When modeling a directed social network, one choice is to use the traditional preferential attachment model, which generates power-law tail distributions. In a traditional directed preferential attachment, every new edge is added…
We study a general $k$ dimensional infinite server queues process with Markov switching, Poisson arrivals and where the service times are fat tailed with index $\alpha\in (0,1)$. When the arrival rate is sped up by a factor $n^\gamma$, the…
In this thesis, we study the optimal tradeoff of average delay, average service cost, and average utility for single server queueing models, with and without admission control. The continuous time and discrete time queueing models that we…
In discrete time, customers arrive at random. Each waits until one of two servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. In the context of an emergency room (for…
We investigate Markovian queues that are examined by a controller at random times determined by a Poisson process. Upon examination, the controller sets the service speed to be equal to the minimum of the current number of customers in the…