We consider the stationary loss rate l(K) of a GI/G/1 queue with finite buffer of size K. Let X-n = U-n - T-n, n >= 1 where U-n is the service time, T-n is the interarrival time and let rho be the traffic intensity. We derive sharp asymptotics for the loss rate as K -> infinity, in the cases (i): rho > 1, and (ii): rho < 1 and X-n non-lattice with light tails. We also look at another reflection, related to Moran's dam model. As an example, we look at the PH/PH/1 case, where we show how to compute the asymptotic loss rate as well as the exact one and illustrate our results numerically
This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue le...
Consider a uid queue with a nite buer B and capacity c fed by a superposition of N independent On-O...
The performance of networks and their ability to offer Quality of Service (QoS) depend on accurately...
The main result in this paper is the characterization of the asymptotic behavior of the loss probabi...
Consider a single server queue with i.i.d. arrival and service processes, fA; A n ; n 1g and fC; C...
Abstract: The paper studies asymptotic behavior of the loss probability for the GI/M/m/n queueing sy...
htmlabstractConsider the single-server queue in which customers are rejected if their total sojourn ...
This paper is concerned with computing large-deviation asymptotics for the loss process in a stylize...
Consider the single-server queue in which customers are rejected if their total sojourn time would e...
In this paper, we provide counterexamples to a conjecture, made by Miyazawa and Tijms [5], on the up...
We consider a Markov modulated fluid queue with a finite buffer. It is assumed that the fluid flow i...
We consider a fluid model similar to that of Kella and Whitt [32], but with a buffer having finite c...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
Consider a discrete time queue with i.i.d. arrivals (see the generalisation below) and a single serv...
In this contribution we investigate higher-order loss characteristics for M/G/1/N queueing systems. ...
This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue le...
Consider a uid queue with a nite buer B and capacity c fed by a superposition of N independent On-O...
The performance of networks and their ability to offer Quality of Service (QoS) depend on accurately...
The main result in this paper is the characterization of the asymptotic behavior of the loss probabi...
Consider a single server queue with i.i.d. arrival and service processes, fA; A n ; n 1g and fC; C...
Abstract: The paper studies asymptotic behavior of the loss probability for the GI/M/m/n queueing sy...
htmlabstractConsider the single-server queue in which customers are rejected if their total sojourn ...
This paper is concerned with computing large-deviation asymptotics for the loss process in a stylize...
Consider the single-server queue in which customers are rejected if their total sojourn time would e...
In this paper, we provide counterexamples to a conjecture, made by Miyazawa and Tijms [5], on the up...
We consider a Markov modulated fluid queue with a finite buffer. It is assumed that the fluid flow i...
We consider a fluid model similar to that of Kella and Whitt [32], but with a buffer having finite c...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
Consider a discrete time queue with i.i.d. arrivals (see the generalisation below) and a single serv...
In this contribution we investigate higher-order loss characteristics for M/G/1/N queueing systems. ...
This thesis consists of five papers (A-E). In Paper A, we study transient properties of the queue le...
Consider a uid queue with a nite buer B and capacity c fed by a superposition of N independent On-O...
The performance of networks and their ability to offer Quality of Service (QoS) depend on accurately...