This paper analyzes a renewal input  working vacations queue with change over times and Bernoulli schedulevacation interruption under (a,c,b) policy.The service and vacation times are exponentially distributed.The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b (a

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.? 

I analyze packet routing on unidirectional ring networks, with an eye towards establishing bounds on the expected length of the queues. Suppose we route packets by a greedy “hot potato” protocol. If packets are inserted by a Bernoulli process and have uniform destinations around the ring, and if the nominal load is kept fixed, then I can construct an upper bound on the expected queue length per...

We present in this paper the joint optimization of a dynamic queue scheduling scheme for the provision of Quality of Service (QoS) over Wireless Local Area Networks (WLANs). Previous works tune the size of the queue of the scheduler according to the requirements of the users either in terms of expected delay or required throughput. In this paper, we present a joint optimization of the scheduler...

— We consider in this paper the steady state behaviour of a Queueing System with queue length dependent additional server facility wherein arrivais occur in batches of variable size. Whenever the queue length in front of the first server reaches a certain lenght, the system adds another server. Steady state probabilities and expected queue lengths in Single Server System and Additional Server S...

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

The machine repair problem with spares and additional repairman is analyzed. The interfailure and repair times of the units are general identical and independently distributed. The failure and repair rates are assumed to be state dependent. Using diffusion approximation technique, we obtain the queue size distribution under steady state. The average number of failed units, average number of ope...

The queue-read, queue-write (QRQW) parallel random access machine (PRAM) model is a shared memory model which allows concurrent reading and writing with a time cost proportional to the contention. This is designed to model currently available parallel machines more accurately than either the CRCW PRAM or EREW PRAM models. Here we present a lower bound for the problem of Linear Approximate Compa...

We study the optimal scaling of the expected total queue size in an n×n input-queued switch, as a function of the number of ports n and the load factor ρ, which has been conjectured to be Θ(n/(1−ρ)) (cf. [15]). In a recent work [16], the validity of this conjecture has been established for the regime where 1 − ρ = O(1/n). In this paper, we make further progress in the direction of this conjectu...

We consider a priority queueing system where single processor serves k classes of packets that are generated randomly following Poisson processes. Our objective is to compute the expected Peak Age Information (PAoI) under various scenarios. In particular, we two situations buffer size at each queue one and infinite, in infinite case First Come Serve (FCFS) Last (LCFS) as service disciplines. Fo...