Hostname: page-component-745bb68f8f-b6zl4 Total loading time: 0 Render date: 2025-02-11T01:36:39.284Z Has data issue: false hasContentIssue false

ON THE COMPARISON OF QUEUEING SYSTEMS WITH THEIR FLUID LIMITS

Published online by Cambridge University Press:  10 April 2001

Eitan Altman
Affiliation:
INRIA, 06902 Sophia Antipolis, France, E-mail: altman@sophia.inria.fr
Tania Jiménez
Affiliation:
INRIA, 06902 Sophia Antipolis, France, and, CeSiMo, Universidad de Los Andes, Mérida, Venezuela, E-mail: tania@ula.ve
Ger Koole
Affiliation:
Vrije Universiteit, 1081 HV Amsterdam, The Netherlands, E-mail: koole@cs.vu.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this article, we study a method to compare queueing systems and their fluid limits. For a certain class of queueing systems, it is shown that the expected workload (and certain functions of the workload) is higher in the queueing system than in the fluid approximation. This class is characterized by convexity of the value function in the state component(s) where external arrivals occur. The main example that we consider is a tandem of multiserver queues with general service times and Markov-modulated arrivals. The analysis is based on dynamic programming and the use of phase-type distributions. Numerical examples to illustrate the results are also given.

Type
Research Article
Copyright
© 2001 Cambridge University Press