Add to ORKGIn this paper we study the asymptotics of the queue length in a buffer fed by an M/G/∞ input process where G is a subexponential distribution. More precisely, we derive asymptotic upper and lower bounds on the queue length distribution. We find the bounds to be tight in some instances, e.g., G corresponding to either the Pareto or lognormal distribution and c\Gammaae ! 1 where c is the rate at which the buffer receives service and ae is the arrival rate to the buffer
We study the occurrence of large queue lengths in the GI / GI / d queue with heavy-tailed Weibull-ty...
This chapter is a non-technical introduction to large deviations of queues with long-range dependent...
Abstract|We analyze the arrival process of Long range de-pendent (LRD) traÆc and demonstrate that it...
In this paper we study the asymptotic behavior of the tail of the stationary backlog distribution in...
The infinite server model of Cox with arbitrary service time distribution appears to provide a very ...
Consider an aggregate arrival process A N obtained by multiplexing N On-Off processes with exponen...
Consider an aggregate arrival process A N obtained by multiplexing N On-Off sources with exponenti...
International audienceIn this work we compute the exact tail asymptotics of the stationary workload ...
The queue-length distribution, the loss ratio, and the delay probability are QoS (Quality of Service...
In this thesis, we study an important measure of network congestion: the queue length (buffer occupa...
Abstract This paper considers the stationary queue length and waiting time distributions in a FIFO B...
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in...
Abstract. In this paper, we consider a discrete time queueing sys-tem fed by a superposition of an O...
Consider a buffer whose input is a superposition of L independent identical sources, and which is se...
Consider a single server queue with i.i.d. arrival and service processes, fA; A n ; n 1g and fC; C...
We study the occurrence of large queue lengths in the GI / GI / d queue with heavy-tailed Weibull-ty...
This chapter is a non-technical introduction to large deviations of queues with long-range dependent...
Abstract|We analyze the arrival process of Long range de-pendent (LRD) traÆc and demonstrate that it...
In this paper we study the asymptotic behavior of the tail of the stationary backlog distribution in...
The infinite server model of Cox with arbitrary service time distribution appears to provide a very ...
Consider an aggregate arrival process A N obtained by multiplexing N On-Off processes with exponen...
Consider an aggregate arrival process A N obtained by multiplexing N On-Off sources with exponenti...
International audienceIn this work we compute the exact tail asymptotics of the stationary workload ...
The queue-length distribution, the loss ratio, and the delay probability are QoS (Quality of Service...
In this thesis, we study an important measure of network congestion: the queue length (buffer occupa...
Abstract This paper considers the stationary queue length and waiting time distributions in a FIFO B...
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in...
Abstract. In this paper, we consider a discrete time queueing sys-tem fed by a superposition of an O...
Consider a buffer whose input is a superposition of L independent identical sources, and which is se...
Consider a single server queue with i.i.d. arrival and service processes, fA; A n ; n 1g and fC; C...
We study the occurrence of large queue lengths in the GI / GI / d queue with heavy-tailed Weibull-ty...
This chapter is a non-technical introduction to large deviations of queues with long-range dependent...
Abstract|We analyze the arrival process of Long range de-pendent (LRD) traÆc and demonstrate that it...