Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-12T20:32:02.388Z Has data issue: false hasContentIssue false

On the service time distribution and the waiting time process of a potentially infinite capacity queueing system

Published online by Cambridge University Press:  14 July 2016

Nasser Hadidi*
Affiliation:
University of Oslo

Abstract

In [1] the authors dealt with a particular queueing system in which arrivals occurred in a Poisson stream and the probability differential of a service completion was μσn when the queue contained n customers. Much of the theory could not be carried out further analytically for a general σn, which is a purely n-dependent quantity. To carry the analysis further to the extent of finding the “effective” service time and the waiting time distribution when σn is a linear function of n, (which is considered to be rather general and sufficient for practical purposes), constitutes the subject matter of this paper.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 

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

[1] Hadidi, N. and Conolly, B. W. (1969) On the improvement of the operational characteristics of single server queues by the use of a queue length dependent service mechanism. Appl. Statist. 18, (in press).CrossRefGoogle Scholar
[2] Conolly, B. W. and Hadidi, N. (1969) A correlated queue. J. Appl. Prob. 6, 122136.CrossRefGoogle Scholar
[3] Conolly, B. W. and Hadidi, N. (1969) A comparison of the operational features of the conventional M/M/1, D/M/1 and M/D/1 queues with those of a self regulating system. Appl. Statist. 18, 4153.CrossRefGoogle Scholar