Motivated by various applications in logistics, road traffic and production management, we investigate two versions of a tandem queueing model in which the service rate of the first queue can be controlled. The objective is to keep the mean number of jobs in the second queue as low as possible, without compromising the total system delay (i.e. avoiding starvation of the second queue). The balan...

A banyan network analysis technique is presented which more accurately models a congested network than other reported techniques. The analysis is based on the observation that a full queue (within the switching modules making up the network) causes traffic to back up. For a short time after becoming full the free space in the queue is limited to no more than one slot. A queue in such a conditio...

Polling models are used as an analytical performance tool in several application areas. In these models, the focus often is on controlling the operation of the server as to optimize some performance measure. For several applications, controlling the server is not an issue as the server moves independently in the system. We present the analysis for such a polling model with a so-called autonomou...

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

This paper studies how to design a stabilizing AQM in supporting TCP (Transmission Control Protocol) with arbitrary delays. For the well-known AIMD (Additive Increase Multiplicative Decrease) dynamic model of TCP, our study shows that we can compensate for arbitrary delays explicitly by applying a modified virtual queue dynamics that makes the equilibrium queuing delay zero. This study also ver...

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic ...

In this paper we study a two-queue polling model with zero switch-over times and k-limited service (serve at most ki customers during one visit period to queue i , i = 1, 2) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exa...

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

One of the most comprehensive theories stochastic models is queueing theory. Through innovative analytical research with broad applicability, advanced theoretical are being developed. In present research, we would like to investigate at a queuing network model low and high priority users different server transition probabilities. The two service channels used in this study, <img src=image/13428...

Using a queuing approach to describe a shared memory parallel computer system, it can be considered as a parallel computer system with a shared single ready queue. This can depict a single queue parallel server queuing model. Some models that are based on probability density function have been used to model the performance of the queuing system. This paper uses recursive models to evaluate the ...