Transient laws of non-stationary queueing systems and their applications

Transient laws of non-stationary queueing systems and their applications

0.00 Avg rating0 Votes
Article ID: iaor20002494
Country: United States
Volume: 25
Issue: 1/4
Start Page Number: 115
End Page Number: 155
Publication Date: Jun 1997
Journal: Queueing Systems
Authors: ,
Keywords: Little's law
Abstract:

In this paper we consider the general class of non-stationary queueing models and identify structural relationships between the number of customers in the system and the delay at time t, denoted by L(t) and S(t), respectively. In particular, we first establish a transient Little's law at the same level of generality as the classical stationary version of Little's law. We then obtain transient distributional laws for overtake free non-stationary systems. These laws relate the distributions of L(t) and S(t) and constitute a complete set of equations that describes the dynamics of overtake free non-stationary queueing systems. We further extend these laws to multiclass systems as well. Finally, to demonstrate the power of the transient laws we apply them to a variety of queueing systems: Infinite and single server systems with non-stationary Poisson arrivals and general non-stationary services, multiclass single server systems with general non-stationary arrivals and services, and multiserver systems with renewal arrivals and deterministic services, operating in the transient domain. For all specific systems we relate the performance measures using the established set of laws and obtain a complete description of the system in the sense that we have a sufficient number of integral equations and unknowns. We then solve the set of integral equations using asymptotic expansions and exact numerical techniques. We also report computational results from our methods.

Reviews

Required fields are marked *. Your email address will not be published.