Consider a uid queue with a nite buer B and capacity c fed by a superposition of N independent On-O processes. An On-O process consists of a sequence of alternating indepen-dent activity and silence periods. Successive activity, as well as silence, periods are identically distributed. The process is active with probability p and during its activity period produces uid at constant rate r. For this queueing system, under the assumption that the excess ac-tivity periods are intermediately regularly varying, we derive explicit and asymptotically exact formulas for approximating the stationary over ow probability and loss rate. In the case of homogeneous processes with excess activity periods equal in distribution to e, the queue loss rate i...
Consider the single-server queue in which customers are rejected if their total sojourn time would e...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
We study congestion periods in a finite fluid buffer when the net inputrate depends upon a recurrent...
We consider a fluid queue fed by multiple on-off flows with heavy-tailed (regularly varying) on-peri...
We consider a fluid queue fed by multiple on-off flows with heavy-tailed (regularly varying) on-peri...
Abstract—We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying...
We consider a fl??uid model similar to that of Kella and Whitt [33], but with a buff??er having ??fi...
We consider a fluid queue fed by multiple On–Off flows with heavy-tailed (regularly varying) On peri...
We consider a Markov modulated fluid queue with a finite buffer. It is assumed that the fluid flow i...
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...
Consider a discrete time queue with i.i.d. arrivals (see the generalisation below) and a single serv...
Abstract This paper considers the tail asymptotics for a cumulative process {B(t); t ≥ 0} sampled at...
Consider an aggregate arrival process A N obtained by multiplexing N On-Off processes with exponen...
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...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
We study congestion periods in a finite fluid buffer when the net inputrate depends upon a recurrent...
We consider a fluid queue fed by multiple on-off flows with heavy-tailed (regularly varying) on-peri...
We consider a fluid queue fed by multiple on-off flows with heavy-tailed (regularly varying) on-peri...
Abstract—We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying...
We consider a fl??uid model similar to that of Kella and Whitt [33], but with a buff??er having ??fi...
We consider a fluid queue fed by multiple On–Off flows with heavy-tailed (regularly varying) On peri...
We consider a Markov modulated fluid queue with a finite buffer. It is assumed that the fluid flow i...
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...
Consider a discrete time queue with i.i.d. arrivals (see the generalisation below) and a single serv...
Abstract This paper considers the tail asymptotics for a cumulative process {B(t); t ≥ 0} sampled at...
Consider an aggregate arrival process A N obtained by multiplexing N On-Off processes with exponen...
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...
AbstractThis paper studies a multiple-server queueing model under the assumptions of renewal arrival...
We study congestion periods in a finite fluid buffer when the net inputrate depends upon a recurrent...