Hostname: page-component-7dd5485656-dk7s8 Total loading time: 0 Render date: 2025-10-31T03:57:30.177Z Has data issue: false hasContentIssue false
  • English
  • Français

ON THE COMPARISON OF QUEUEING SYSTEMS WITH THEIR FLUID LIMITS

Published online by Cambridge University Press:  10 April 2001

Eitan Altman ,
Tania Jiménez  and
Ger Koole
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
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 15 , Issue 2 , April 2001 , pp. 165 - 178
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable