We derive asymptotic expressions for the distribution of the total queue length in a polling model with two classes of customers and unequal service rates. The server employs a scheduling policy that alternately visits each queue, with the maximum number served in each visit potentially being different for each queue. We provide sufficient conditions for the behaviour to lie in one of two regim...

In this study, the disturbance and uncertainty on nonlinear and time varying systems as Active Queue Management (AQM) is analyzed. Many of AQM schemes have been proposed to regulate a queue size close to a reference level with the least variance. We apply a normal range of disturbances and uncertainty such as variable user numbers, variable link capacity, noise, and unresponsive flows, to the t...

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

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

This paper deals with multi-component machine repair model having provision of warm standby units and repair facility consisting of two heterogeneous servers (primary and secondary) to provide repair to the failed units. The failure of operating and standby units may occur individually or due to some common cause. The primary server may fail partially following full failure whereas secondary se...