Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival t...

In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.? 

Fifth-generation (5G) systems have brought about new challenges toward ensuring Quality of Service (QoS) in differentiated services. This includes low latency applications, scalable machine-to-machine communication, and enhanced mobile broadband connectivity. In order to satisfy these requirements, the concept network slicing has been introduced generate slices with specific characteristics. me...

We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are independent and identically distributed. We call this the random scattering traffic model, and the queueing model RS/G/1. We study the workload process associated with the queue in two different settings. First, we present Gaussian process approximations in a high ...

We consider the Erlang A model, or [Formula: see text] queue, with Poisson arrivals, exponential service times, and m parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length process is in this case a birth-death process, for which we obtain explicit expressions for the Laplace transforms of the time-dependent distribution and the f...

D. A. RANDALL, l R. D. CESS, 2 J.P. BLANCHET, 3 G. J. BOER, 3 D. A. DAZLICH, • A.D. DEL GENIO, 4 M. DEQUE, 5 V. DYMNIKOV, 6 V. GALIN, 6 S. J. GHAN, 7 A. A. LACIS, 4 H. LE TREUT, 8 Z.-X. LI, 8 X.-Z. LIANG, 9 B. J. MCAVANEY, •ø V. P. MELESHKO, TM J. F. B. MITCHELL, •2 J.-J. MORCRETTE, •3 G. L. POTTER, 7 L. RIKUS, lø E. ROECKNER, TM J. F. ROYER, 5 U. SCHLESE, TM D. m. SHEININ, TM J. SLINGO, 15 A. ...

This paper analyses a multiple class single server M/M/1/K queue with finite capacity under weighted fair queuing (WFQ) discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. We assume each class is assigned a virtual queue and incoming jobs enter the virtual queue related to their class and served in FIFO...