Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-27T09:35:56.626Z Has data issue: false hasContentIssue false
  • English
  • Français

GEOMETRIC-FORM BOUNDS FOR THE GIX/M/1 QUEUEING SYSTEM

Published online by Cambridge University Press:  01 October 1999

Antonis Economou
Antonis Economou
Affiliation:
Department of Mathematics, University of Athens, Athens 11528, Greece
Get access Rights & Permissions [Opens in a new window]

Abstract

The GI/M/1 queueing system was long ago studied by considering the embedded discrete-time Markov chain at arrival epochs and was proved to have remarkably simple product-form stationary distributions both at arrival epochs and in continuous time. Although this method works well also in several variants of this system, it breaks down when customers arrive in batches. The resulting GIX/M/1 system has no tractable stationary distribution. In this paper we use a recent result of Miyazawa and Taylor (1997) to obtain a stochastic upper bound for the GIX/M/1 system. We also introduce a class of continuous-time Markov chains which are related to the original GIX/M/1 embedded Markov chain that are shown to have modified geometric stationary distributions. We use them to obtain easily computed stochastic lower bounds for the GIX/M/1 system. Numerical studies demonstrate the quality of these bounds.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 13 , Issue 4 , October 1999 , pp. 509 - 520
Copyright
© 1999 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.)