Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T05:19:51.652Z Has data issue: false hasContentIssue false

Approximation of the queue-length distribution of an M/GI/s queue by the basic equations

Published online by Cambridge University Press:  14 July 2016

Masakiyo Miyazawa*
Affiliation:
Science University of Tokyo
*
∗ Postal address: Department of Information Sciences, Faculty of Science and Technology, Science University of Tokyo, Noda City, Chiba 278, Japan.

Abstract

We give a unified way of obtaining approximation formulas for the steady-state distribution of the queue length in the M/GI/s queue. The approximations of Hokstad (1978) and Case A of Tijms et al. (1981) are derived again. The main interest of this paper is in considering the theoretical meaning of the assumptions given in the literature. Having done this, we derive new approximation formulas. Our discussion is based on one version of the steady-state equations, called the basic equations in this paper. The basic equations are derived for M/GI/s/k with finite and infinite k. Similar approximations are possible for M/GI/s/k (k < +∞).

Information

Type
Research Paper
Copyright
Copyright © Applied Probability Trust 1986 

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