Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Mar 8, 2013 · Under the FCFS discipline, the result on the waiting time is proved for the more general G I / G / 1 / K queue with subexponential service times ...
We study the asymptotic behavior of the tail probabilities of the waiting time and the busy period for the $$M/G/1/K$$ queues with subexponential service ...
PDF | We study the asymptotic behavior of the tail probabilities of the waiting time and the busy period for the $M/G/1/K$ queues with subexponential.
Missing: \varvec
This paper considers a heterogeneous M/G/2 queue. The service times at server 1 are exponentially distributed, and at server 2 they have a general ...
Introduction. In this paper, we consider the stable GI/G/1 queue in which the service time has a heavy (subexponential) tail. The single server queue is a ...
Missing: \varvec
The joint distribution of the length of a busy period and the number of customers served during that busy period in an M/G/1 queue with a finite capacity is ...
This paper considers a stable GI/GI/1 queue with subexponential service time distribution. Under natural assumptions we derive the tail behaviour of the ...
Missing: \varvec
Abstract. This paper considers a stable GI/GI/1 queue with subexponential service time distribution. Under natural assumptions we derive the tail behaviour ...
Missing: \varvec
We study the asymptotic behavior of tail probability for the waiting time in the steady-state M/G/1/ROS multiple-vacation queue with regularly-varying ...
We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period.