Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-22T11:41:24.335Z Has data issue: false hasContentIssue false
  • English
  • Français

A comparison of the stationary distributions of GI/M/c/n and GI/M/c

Published online by Cambridge University Press:  14 July 2016

F. Simonot
F. Simonot*
Affiliation:
ESSTIN
*
∗Postal address: ESSTIN-Parc. R. Bentz, 54500, Vandoeuvre, France. E-mail address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this note, we compare the arrival and time stationary distributions of the number of customers in the GI/M/c/n and GI/M/c queueing systems as n tends to infinity. We show that earlier results established for GI/M/1/n and GI/M/1 remain true. Namely, it is proved that if the interarrival time c.d.f. H is non lattice with mean value λ−1 and if the traffic intensity is strictly less than one, then the convergence rates in l1norm of the arrival and time stationary distributions of GI/M/c/n to the corresponding stationary distributions of GI/M/c are geometric and are characterized by ω, the unique solution in (0,1) of the equation z = ∫∞0 exp{-μc(1-z)t}dH(t).

Keywords

GI/M/c/nMarkov chainconvergence ratel1 norm
Type
Short Communications
Information
Journal of Applied Probability , Volume 35 , Issue 2 , June 1998 , pp. 510 - 515
Copyright
Copyright © Applied Probability Trust 1998 

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.)

References

Asmussen, S. (1987). Applied Probability and Queues. Wiley.Google Scholar
Brandt, A. (1987). On stationary queue length distributions for G/M/s/r queues. Queueing Systems 2, 321–32.Google Scholar
Gross, D., and Harris, C.M. (1985). Fundamentals of Queueing Theory, 2nd edn. Wiley.Google Scholar
Simonot, F. (1997). Convergence rate for the distributions of GI/M/1/n and M/GI/1/n as n tends to infinity. J. Appl. Prob. 34, 1049–1060.Google Scholar
Takacz, L. (1962). An Introduction to the Theory of Queues. Oxford University Press.Google Scholar