Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-20T21:13:43.227Z Has data issue: false hasContentIssue false

An extension of Erlang's loss formula

Published online by Cambridge University Press:  14 July 2016

Ronald W. Wolff
Affiliation:
University of California, Berkeley
Charles W. Wrightson
Affiliation:
University of California, Berkeley

Abstract

A two-server loss system is considered with N classes of Poisson arrivals, where the service distribution function and server preferences are arrival-class dependent. The stationary state probabilities are derived and found to be independent of the form of the service distributions.

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1976 

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] Carter, G. M., Chaiken, J. M. and Ignall, E. (1972) Response areas for two emergency units. Operat. Res. 20, 571593.CrossRefGoogle Scholar
[2] Chaiken, J. M. and Ignall, E. (1972) An extension of Erlang's formulas which distinguishes individual servers. J. Appl. Prob. 9, 192197.CrossRefGoogle Scholar
[3] Chaiken, J. M. and Larson, R. C. (1972) Methods for allocating urban emergency units: a survey. Management Sci. 19, P–110–P–130.Google Scholar
[4] Little, J. D. C. (1961) A proof of the queuing formula: L = ? W . Operat. Res. 9, 383387.CrossRefGoogle Scholar
[5] Stidham, S. (1972) Regenerative processes in the theory of queues, with applications to the alternating-priority queue. Adv. Appl. Prob. 4, 542577.CrossRefGoogle Scholar
[6] Takács, L. (1969) On Erlang's formula. Ann. Math. Statist. 40, 7178.CrossRefGoogle Scholar
[7] Wolff, R. W. (1970) Work-conserving priorities. J. Appl. Prob. 7, 327337.CrossRefGoogle Scholar