Hostname: page-component-7dd5485656-g8tfn Total loading time: 0 Render date: 2025-10-30T22:04:26.142Z Has data issue: false hasContentIssue false
  • English
  • Français

An embedded level crossing technique for dams and queues

Published online by Cambridge University Press:  14 July 2016

P. H. Brill
P. H. Brill*
Affiliation:
University of Toronto
*
∗ Presently with Department of Quantitative Methods, University of Illinois, Chicago, IL 60680, U.S.A. This work was sponsored by the National Research Council of Canada under Grants # A4374 and # A2796.
Get access Rights & Permissions [Opens in a new window]

Abstract

The new concept of embedded level crossings is combined with the old principle of stationary set balance to produce an alternative approach for obtaining the steady-state distribution of the level in a dam with general release rule. The method yields the steady state distribution of the customer waiting time in the GI/G/1 queue as a special case. Results for a dam in which the instantaneous release rate is proportional to the level, and for the M/G/1, GI/M/1, Ek/M/1 and D/M/1 queues are derived using the new technique.

Keywords

LEVEL CROSSINGSEMBEDDED STOCHASTIC PROCESSSTATIONARY SET BALANCEDAMSQUEUES

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 16 , Issue 1 , March 1979 , pp. 174 - 186
Copyright
Copyright © Applied Probability Trust 1979 

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

References

[1] Brill, P. H. (1975) System Point Theory in Exponential Queues. Ph.D. Dissertation, University of Toronto.Google Scholar
[2] Brill, P. H. and Moon, R. E. (1978) An application of queueing theory to pharmacokinetics. Submitted for publication.Google Scholar
[3] Brill, P. H. and Posner, M. J. M. (1975) Level crossings in point processes applied to queues: single server case. Opns Res. 25, 662–674.CrossRefGoogle Scholar
[4] Brill, P. H. and Posner, M. J. M. (1976) On the equilibrium waiting distribution for a class of exponential queues. Working paper 74–012, Dept, of Industrial Engineering, University of Toronto.Google Scholar
[5] Feller, W. (1966) An Introduction to Probability Theory and its Applications, Vol. 2. Wiley, New York.Google Scholar
[6] Gaver, D. P. and Miller, R. G. (1962) Limiting distributions for some storage problems. In Studies in Applied Probability and Management Science, ed. Arrow, K. J., Karlin, S. and Searf, H. Stanford University Press.Google Scholar
[7] Kendall, D. G. (1953) Stochastic processes occurring in the theory of queues and their analysis by the method of embedded Markov chains. Ann. Math. Statist. 24, 338–354.Google Scholar
[8] Laslett, G. M., Pollard, D. B. and Tweedie, R. L. (1978) Techniques for establishing ergodic and recurrence properties of continuous-time Markov chains. Naval Res. Log. Quart. To appear.CrossRefGoogle Scholar
[9] Leadbetter, M. R. (1972) Point processes generated by level crossings. In Stochastic Point Processes: Statistical Analysis, Theory and Applications, ed. Lewis, P. A. W. Wiley, New York, pp. 436–467.Google Scholar
[10] Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–289.Google Scholar
[11] Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York, pp. 49–50, 67–69.Google Scholar