Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T11:45:54.800Z Has data issue: false hasContentIssue false

On the transient state probabilities for a queueing model where potential customers are discouraged by queue length

Published online by Cambridge University Press:  14 July 2016

Bent Natvig*
Affiliation:
University of Trondheim — NTH, Norway
*
* Now at the University of Sheffield.

Abstract

Earlier work by Hadidi and Conolly and contemporary work by the author point to the great operational advantages of state-dependent queueing models. Let pin (t) be the state probabilities and p∗in the corresponding L.T.'s relative to the single server birth-and-death queueing process with parameters λn = λ/(n + 1), n ≥ 0, μn = μ, n ≥ 1. We have obtained an exact formulation of p ∗ i0 , p ∗ in (n ≥ 1) being determined recursively. An exact expression for p 10(t) is given in the case of low traffic intensities, and this has been approximated efficiently. Numerical evaluations show that the steady-state is reached very rapidly.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1974 

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