Queues with Slowly Varying Arrival and Service Processes

Management Science · 1990 · Volume 36 · Issue 8

Abstract

We examine a generalisation of the M / G /1 queue. The arrival and service processes are governed by a Markov chain which determines the rate of arrival and the service time distribution from a finite set. This Markov chain is assumed to vary “slowly”, so that we are able to derive analytical results for the stationary distribution of the queue length using an approach based on decomposability. The practical interest of this model stems from the numerous applications where the parameters of queueing systems are time varying, such as inventory models, telephone systems, time-sharing systems, computer networks with bursty traffic, etc. We also show how this approach can be extended to arbitrary networks of queues and in particular to those with product form solution.

Keywords

queing, time variations, decomposition

Enable JavaScript for citation tools and additional paper interactions.