Sojourn times in a random queue with and without preemption

European Journal of Operational Research

Volumn 112, Issue 3, 1999, Pages 646-653

  Field, A J ^a   Harrison, P G ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LAPLACE TRANSFORMS; PROBABILITY DISTRIBUTIONS;

LAPLACE-STIELTJES TRANSFORMS; SOJOURN TIME DISTRIBUTIONS;

QUEUEING THEORY;

EID: 0033079223     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00407-4     Document Type: Article

References (10)

1. Abate J., Whitt W. Numerical inversion of Laplace transforms of probability distributions. ORSA Journal on Computing. 7(1):1995;36-43.
2. Ayres, F., 1952. Theory and problems of differential equations. Schaum's Outline Series, McGraw Hill, New York, 1952.
3. Carter G.M., Cooper R.B. Queues with service in random order. Oper. Res. 20:1972;389-405.
4. Coffman E.G., Muntz R.R., Trotter H. Waiting time distributions for processor sharing systems. JACM. 17(1):1970;123-130.
5. Field, A.J., Harrison, P.G., 1993. Transmission times in buffered full-crossbar communication networks with cyclic arbitration. Proceedings 1993 International Conference on Parallel Processing, vol I 186-196.
6. Fuhrmann S.W., Iliadis I. A comparison of three random disciplines. Queueing Systems. 18:1994;249-271.
7. Harrison, P.G., Patel, N.M., 1993. Performance Modelling of Communication Networks and Computer Architectures. Addison-Wesley, Reading, MA.
8. Palm C. Research on telephone traffic carried by full availability groups. Tele, English Edition. 1:1957;1-107.
9. Syski, R., 1986. Introduction to Congestion Theory in Telephone Systems. North-Holland, Amsterdam.
10. Wolfram, S., 1988. Mathematica, Addison Wesley, Reading, MA.