Multi-threshold Control of the BMAP/SM/1/K Queue with Group Services

We consider a finite capacity queue in which arrivals occur according to a batch Markovian arrival process (BMAP). The customers are served in groups of varying sizes. The services are governed by a controlled semi-Markovian process according to a multithreshold strategy. We perform the steady-state analysis of this model by computing (a) the queue length distributions at departure and arbitrary epochs, (b) the Laplace-Stieltjes transform of the sojourn time distribution of an admitted customer, and (c) some selected system performance measures. An optimization problem of interest is presented and some numerical examples are illustrated

Threshold queueing describes the fundamental diagram of uninterrupted traffic

Queueing due to congestion is an important aspect of road traffic. This paper provides a brief overview of queueing models for traffic and a novel threshold queue that captures the main aspects of the empirical shape of the fundamental diagram. Our numerical results characterises the sources of variation that influence the shape of the fundamental diagram

Service systems with balking based on queueing time

We consider service systems with balking based on queueing time, also called queues with wait-based balking. An arriving customer joins the queue and stays until served if and only if the queueing time is no more than some pre-specified threshold at the time of arrival. We assume that the arrival process is a Poisson process. We begin with the study of theM/G/1 system with a deterministic balking threshold. We use level-crossing argument to derive an integral equation for the steady state virtual queueing time (vqt) distribution. We describe a procedure to solve the equation for general distributions and we solve the equation explicitly for several special cases of service time distributions, such as phase type, Erlang, exponential and deterministic service times. We give formulas for several performance criteria of general interest, including average queueing time and balking rate. We illustrate the results with numerical examples. We then consider the first passage time problem in an M/PH/1 setting. We use a fluid model where the buffer content changes at a rate determined by an external stochastic process with finite state space. We derive systems of first-order linear differential equations for both the mean and LST (Laplace-Stieltjes Transform) of the busy period in the fluid model and solve them explicitly. We obtain the mean and LST of the busy period in the M/PH/1 queue with wait-based balking as a special limiting case of the fluid model. We illustrate the results with numerical examples. Finally we extend the method used in the single server case to multi-server case. We consider the vqt process in an M/G/s queue with wait-based balking. We construct a single server system, analyze its operating characteristics, and use it to approximate the multi-server system. The approximation is exact for the M/M/s and M/G/1 system. We give both analytical results and numerical examples. We conduct simulation to assess the accuracy of the approximation