Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T08:29:45.721Z Has data issue: false hasContentIssue false

On the convergence to stationarity of the many-server Poisson queue

Published online by Cambridge University Press:  14 July 2016

Wolfgang Stadje*
Affiliation:
University of Osnabrück
P. R. Parthasarathy*
Affiliation:
Indian Institute of Technology, Madras
*
∗ Postal address: Fachbereich Mathematik/Informatik, University of Osnabrück, 49069 Osnabrück, Germany. Email address: wolfgang@mathematik.uni-osnabrueck.de.
∗∗ Postal address: Department of Mathematics, Indian Institute of Technology, Madras, Chennai-600036, India.

Abstract

We consider the many-server Poisson queue M/M/c with arrival intensity λ, mean service time 1 and λ/c < 1. Let X(t) be the number of customers in the system at time t and assume that the system is initially empty. Then p n (t) = P(X(t) = n) converges to the stationary probability πn = P(X = n). The integrals ∫0 ∞[E(X)-E(X(t))]dt and ∫0 ∞[P(X≤n) − P(X(t)≤n)]dt are a measure of the speed of convergence towards stationarity. We express these integrals in terms of λ and c.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1999 

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