Shortest expected delay routing for Erlang servers

Queueing Systems

Volumn 23, Issue 1-4, 1996, Pages 77-105

  Adan, Ivo ^a   Wessels, Jaap ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Dynamic routing; Equilibrium distribution; Queues; Random walks

Indexed keywords

DYNAMIC ROUTING; EFFICIENT COMPUTATION; EQUILIBRIUM DISTRIBUTIONS; GENERATING FUNCTION APPROACH; PERFORMANCE CRITERION; QUEUES; RANDOM WALK; WAITING TIME DISTRIBUTIONS;

QUEUEING THEORY;

EID: 0039564894     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/bf01206552     Document Type: Article

References (18)

1. I.J.B.F. Adan and J. Wessels, Analysing shortest expected delay routing for erlang servers, Memorandum COSOR 93-38, Department of Mathematics and Computing Science, Eindhoven University of Technology (1993).
2. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the symmetric shortest queue problem, Stochastic Models 6 (1990) 691-713.
3. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the asymmetric shortest queue problem with threshold jockeying, Stochastic Models 7 (1991) 615-627.
4. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the asymmetric shortest queue problem, Queueing Systems 8 (1991) 1-58.
5. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, A compensation approach for two-dimensional Markov processes, Adv. Appl. Probab. 25 (1993) 783-817.
6. r/c queues, EJOR 92 (1996) 112-124.
7. I.J.B.F. Adan, G.J. van Houtum, J. Wessels and W.H.M. Zijm, A compensation procedure for multiprogramming queues, O. R.-Spektrum 15 (1993) 95-106.
8. O.J. Boxma and G.J. van Houtum, The compensation approach applied to a 2 × 2 switch, Probab. Engrg. Inform. Sci. 7 (1993) 471-493.
9. J.W. Cohen and O.J. Boxma, Boundary Value Problems in Queueing System Analysis (North-Holland, Amsterdam, 1983).
10. J.W. Cohen, On a class of two-dimensional nearest neighbour random walks, in: Studies in Applied Probability, ed. J. Gani, J. Appl. Prob. (Sp. Vol.) A31 (1994) 207-237.
11. L. Flatto and H.P. McKean, Two queues in parallel, Comm. Pure Appl. Math. 30 (1977) 255-263.
12. F.G. Foster, On the stochastic matrices associated with certain queueing processes, Ann. Math. Statist. 24 (1953) 355-360.
13. F.A. Haight, Two queues in parallel, Biometrika 45 (1958) 401-410.
14. A. Hordijk and G. Koole, On the optimality of the generalized shortest queue policy, Probab. Engrg. Inform. Sci. 4 (1990) 477-487.
15. J.F.C. Kingman, Two similar queues in parallel, Ann. Math. Statist. 32 (1961) 1314-1323.
16. H.C. Tijms, Stochastic Modelling and Analysis: A Computational Approach (Wiley, Chichester, 1986).
17. R.R. Weber, On the optimal assignment of customers to parallel queues, J. Appl. Probab. 15 (1978) 406-413.
18. R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 223-231.