Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-23T17:52:19.915Z Has data issue: false hasContentIssue false

On the waiting-time and busy period distributions for a general birth-and-death queueing model

Published online by Cambridge University Press:  14 July 2016

Bent Natvig*
Affiliation:
University of Sheffield

Abstract

A general birth-and-death queueing model is considered with N waiting positions (0 ≦ N ≦ ∞), s servers (1 ≦ s ≦ ∞) and a first-come-first-served queueing discipline. The first and second order moments of the steady-state waiting-time (excluding service) for a non-lost arriving customer are given. By setting the busy period equal to the time where at least one service is in progress, we obtain the first and second order moments of the length of a busy period and also the distribution of the number served during it, given an arbitrary number of customers present originally. Using a direct approach all expressions are given in explicit forms which, although being far from elegant, are suitable for evaluation on a computer.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1975 

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

Conolly, B. W. (1974) The generalised state dependent Erlangian queue: The busy period. J. Appl. Prob. 11, 618623.Google Scholar
Conolly, B. W. (1975) The generalised state dependent Erlangian queue: Speculations on calculation of measures of effectiveness. J. Appl. Prob. 12, 358363.CrossRefGoogle Scholar
Erdélyi, A. et al. (1954) Tables of Integral Transforms 1. McGraw-Hill, New York.Google Scholar
Feller, W. (1968) An Introduction to Probability Theory and its Applications , Vol. I. (Third edition) Wiley, New York.Google Scholar
Hadidi, N. (1969) On the service time distribution and waiting time process of a potentially infinite capacity queueing system. J. Appl. Prob. 6, 594603.Google Scholar
Hadidi, N. and Conolly, B. W. (1969) On the reduction of congestion. Research Report, Inst. of Math., University of Oslo.Google Scholar
Karlin, S. and Mcgregor, J. (1957) The classification of birth and death processes. Trans. Amer. Math. Soc. 86, 366400.Google Scholar
Knopp, K. (1945) Theory of Functions, Part 1 . Dover, New York.Google Scholar
Natvig, B. (1974) The probability law of the busy period for D/M/1 obtained by an immediate method. Research Report, Department of Probability and Statistics, University of Sheffield.Google Scholar
Natvig, B. (1975a) On a queueing model where potential customers are discouraged by queue length. Scand. J. Statist , 2, 3442.Google Scholar
Natvig, B. (1975b) On the input and output processes for a general birth-and-death queueing model. Adv. Appl. Prob. 7, 576592.Google Scholar
Wolff, R. W. (1965) Problems of statistical inference for birth and death queueing models. Operat. Res. 13, 343357.Google Scholar