We consider a model consisting of two fluid queues driven by the same background continuous-time Markov chain, such that the rates of change of the fluid in the second queue depend on whether the first queue is empty or not. We analyse this tandem model using operator-analytic methods.

A novel approach for obtaining the response time in a discrete-time tandem-queue with blocking is presented. The approach constructs a Markov chain based on the age of the leading customer in the first queue. We also provide a stability condition and carry out several numerical examples. © 2004 Elsevier B.V. All rights reserved.

Consider a tandem queue consisting of two single server queues in series with a Poisson arrival process at the rst queue and arbitrarily distributed service times which for any customer are identical in both queues For this tandem queue we relate the tail behavior of the sojourn time distribution and the workload distribution at the second queue to that of the residual service time distribution...

This paper considers importance sampling as a tool for rare-event simulation. The system at hand is a so-called tandem queue with slow-down, which essentially means that the server of the first queue (or: upstreanm queue) switches to a lower speed when the second queue (downstream queue) exceeds some threshold. The goal is to assess to what extent such a policy succeeds in protecting the first ...

An approximation algorithm is presented for open tandem queueing networks with finite buffers and with general service times. The algorithm decomposes the system into individual queues with revised arrival and service process and revised queue capacity. Then, each queue is analyzed in isolation. The service process is revised so that to reB.ect the additional delay a unit might undergo due to b...

Keywords: Queueing Tandem queueing system Marked Markovian arrival process Phase-type distribution Laplace–Stieltjes transform a b s t r a c t A tandem queueing system with infinite and finite intermediate buffers, heterogeneous customers and generalized phase-type service time distribution at the second stage is investigated. The first stage of the tandem has a finite number of servers without...

We consider a tandem queue with two stations. The first station is an s-server queue with Poisson arrivals and exponential service times. After terminating his service in the first station, a customer enters the second station to require service at an exponential single server, while in the meantime he is blocking his server in station 1 until he completes service in station 2, whereupon the se...

This paper considers access control in a target multiserver loss queue fed by a set of upstream parallel multiserver loss queues and by a stream of new customers. The target queue faces a choice of how many servers to reserve for each stream. Revenue is gained by each station when it serves a customer, but the amount of revenue at the target queue depends on the source of the customer. We prove...