In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...

This paper analyses the steady state behaviour of an M/G/1 retrial queue with impatient subscribers, two phases of essential service, general retrial time and general vacation time. If the primary call, on arrival finds the server busy, becomes impatient and leaves the system with probability (1 ) and with probability , it enters into an orbit. The server provides preliminary first essential se...

We consider the serve-the-longest-queue discipline for a multiclass queue with buffers of equal size, operating under (i) the conventional and (ii) the Halfin-Whitt heavy traffic regimes, and show that while the queue length process’ scaling limits are fully determined by the first and second order data in case (i), they depend on finer properties in case (ii). The proof of the latter relies on...

We use Active Queue Management (AQM) strategy for congestion avoidance in Transmission Control Protocol (TCP) networks to regulate queue size close to a reference level. In this paper we present two efficient and new AQM systems as a queue controller. These methods are designed using Improved Neural Network (INN) and Adaptive Neuro-Fuzzy Inference Systems (ANFIS). Our aim is low queue variation...

We now re-examine the M/M/1 queing system under the more realistic assumption of a finite queue size. Therefore, we assume that the queue can hold up to m packets. If a packet arrives and the queue is full, the packet is simply dropped from the system. The analysis of M/M/1 under this setting will give us some insight into the behavior of networks in general, and an idea for a congestion contro...

We study the impact of service-time distributions on the distribution of the maximum queue length during a busy period for the M/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite buffer (M/G/1/n) systems. We show the somewhat surprising result that for three variations of the preemptive LCFS discipline, the maximum queue ...

A multiple optional vacation policy for the unreliable server batch arrival queueing system with essential and multi optional services under N-policy is investigated. According to vacation policy, the server takes an essential phase of vacation after the completion of service of an individual customer when queue becomes empty. On returning from the vacation, if the server finds the queue empty,...

This paper studies the performance of latency insensitive systems with limited queue size, in contrast with previous studies that assumed unlimited queue size. We obtain a tight theoretical performance upper bound of such systems. This paper also proposes an efficient implementation of latency insensitive systems. Experimental results show that our implementation can always reach the theoretica...