In this paper we investigate an advanced variant of the classical (Jackson) tandem queue, viz. a two-node system with server slow-down. The slow-down mechanism has the primary objective to protect the downstream queue from frequent overflows, and it does so by reducing the service speed of the upstream queue as soon as the number of jobs in the downstream queue reaches some pre-specified thresh...

A tandem retrial queue consisting of two stations is studied. The first station has a single server. An input flow at the first station is described by the Markovian Arrival Process ( MAP ). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first sta...

Tandem queues are good mathematical models of communication systems and networks, so their investigation is important for theory and applications. In this paper, exact analytical analysis of the tandem queue of the BMAP/G/1 → ·/PH/1/M type with customers loss in case when the intermediate buffer is full and with possible feedback is implemented. Possible correlation in the input stream is taken...

In [13] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty. It is assumed that jobs arrive at the first station according to a Poisson process and require service a...

A two-server resequencing system has two heterogeneous servers and two buffers. One is an arrival buffer, which holds incoming jobs waiting for service. The other is a resequencing buffer, which resequences served jobs back to their arrival orders before departure. Such a system can be modeled as a two-stage tandem queue where the jobs are always kept in the arrival orders but the servers swap ...

We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available only for a specific example with two queues in tandem. We propose approximation procedures involving simple analytic expressions, based on mean value analysis (MVA) and on fixed point approach (FPA). The mean sojourn ...

Fluid models have for some time been used to approximate stochastic networks with discrete state. These range from traditional ‘heavy traffic’ approximations to the recent advances in bio-chemical system models. Here we present a simple approximate compositional method for analysing a network of fluid queues with Markovmodulated input processes at equilibrium. The idea is to approximate the on/...

We develop an analytic model for traffic flow analysis in a multi-hop wireless sensor network subject to node failure through a queueing theoretic framework. The dynamics of traffic flow in the source-to-sink path is modeled by a number of singleserver queues with finite capacity linked in tandem. Both the blocking effect of tandem queues due to limited buffer and the impact of node failure due...

Consider a tandem queue of two single-server stations with only one server for both stations, who may allocate a fraction α of the service capacity to station 1 and 1−α to station 2 when both are busy. A recent paper treats this model under classical Poisson, exponential assumptions. Using work conservation and FIFO, we show that on every sample path (no stochastic assumptions), the waiting tim...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...