This paper proposes a new discrete-time queue analytical model based on BLUE algorithm in order to determine the network congestion in preliminary stages. We compare the original BLUE, which has been implemented in Java, with our proposed analytical model with regards to different performance measures (average queue length, throughput, average queueing delay and packet loss probability). The co...

The random early detection (RED) technique has seen a lot of research over the years. However, the functional relationship between RED performance and its parameters viz., queue weight (wq), marking probability (maxp), minimum threshold (minth) and maximum threshold (maxth) is not analytically available. Moreover, the precise dependence between the RED average queue length and its parameters is...

This paper presents the analysis of a renewal input  finite buffer queue wherein the customers can decide either to  join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed  by an underlying $m$-state Markov chain. Employing the supplementary  variable and imbedded Markov chain techniques,   the steady-state system length distributions at pre...

This paper studies virtual machine (VM) scheduling in a queueing cloud computing system with stochastical arrivals of heterogeneous jobs by considering jobs’ delay requirements. The delay-optimal VM such is formulated as multi-resource multi-class problem minimize the average job completion time, which often NP-hard. To solve problem, we first propose model that buffers same type one que...

is a model validated previously. In our study, only the average queue size k q − is considered, and the results are based on analytical model rather than actual measurements. The instabilities in the model are studied numerically using the conventional nonlinear bifurcation analysis. Extending from this bifurcation analysis, a modified RED algorithm is derived to prevent the observed bifurcatio...

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

This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical sin...

In this paper, we analyze the end-to-end routing performance of a wireless sensor network with uncoordinated power management (UPM). In UPM, nodes power on and off with a predetermined duty cycle. We consider the effects of changing the specified duty cycle, spatial node density, and mobility on end-to-end delays, buffering requirements, and the actual, realized energy savings in both stationar...

This paper proposes a controller technique for early stage congestion detection at the router buffer in the networks. The proposed technique extends the well-known Gentle Random Early Detection (GRED) algorithm. Unlike GRED, which relies on parameter settings, such as minthreshold, maxthreshold and double maxthreshold, in order to obtain a satisfactory performance, the proposed technique depend...

Backklling is a simple and eeective way of improving the utilization of space-sharing schedulers. Simple rst-come-rst-served approaches are ineeective because large jobs can fragment the available resources. Backklling schedulers address this problem by allowing jobs to move ahead in the queue, provided that they will not delay subsequent jobs. Previous research has shown that inaccurate estima...