A two-stage tandem queue attended by a moving server with holding and switching costs
We consider a two-stage tandem queue attended by a moving server, with homogeneous Poisson arrivals and general service times. Two different holding costs for stages 1 and 2 and different switching costs from one stage to the other are considered. We ...
Large deviations and the generalized processor sharing scheduling for a two-queue system
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The ...
The combinatorics of birth–death processes and applications to queues
In this paper we present a combinatorial technique which allows the derivation of the transition functions of general birth-death processes. This method provides a flexible tool for the transient analysis of Markovian queueing systems with state ...
An interpolation approximation for the GI/G/1 queue based on multipoint Padé approximation
The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light ...
A single server queue with service interruptions
In this paper we characterize the queue-length distribution as well as the waiting time distribution of a single-server queue which is subject to service interruptions. Such queues arise naturally in computer and communication problems in which ...
Transient and stationary waiting times in (max,+)-linear systems with Poisson input
We consider a certain class of vectorial evolution equations, which are linear in the (max,+) semi-field. They can be used to model several types of discrete event systems, in particular queueing networks where we assume that the arrival process of ...
On the stability of retrial queues
We consider the following type of problems. Calls arrive at a queue of capacity K (which is called the primary queue), and attempt to get served by a single server. If upon arrival, the queue is full and the server is busy, the new arriving call moves ...
