Generalised 'join the shortest queue' policies for the dynamic routing of jobs to multi-class queues

Journal of the Operational Research Society

Volumn 54, Issue 4, 2003, Pages 379-389

  Ansell, P S ^a   Glazebrook, K D ^b   Kirkbride, C ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Dynamic programming; Heuristics; Multi class queues; Routing; Scheduling

Indexed keywords

DECISION MAKING; MARKOV PROCESSES; MATHEMATICAL MODELS; POISSON DISTRIBUTION; PROBABILITY; QUEUEING THEORY; SCHEDULING;

DYNAMIC ROUTING; MULTI-CLASS QUEUE; SHORTEST QUEUE POLICY;

DYNAMIC PROGRAMMING;

EID: 0037723106     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601504     Document Type: Article

References (19)

1. Whitt W (1986). Deciding which queue to join: some counter-examples. Opns Res 34: 55-62.
2. Liu Z and Righter R (1998). Optimal load balancing on distributed homogeneous unreliable processors. Opns Res 46: 563-573.
3. Koole G (1996). On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers. Math Opns Res 21: 469-476.
4. Johri PK (1989). Optimality of the shortest line discipline with state dependent service times. Eur J Opl Res 41: 157-161.
5. Houck DJ (1987). Comparison of policies for routing customers to parallel queueing systems. Opns Res 35: 306-310.
6. Kleinrock L (2002). Creating a mathematical theory of computer networks. Opns Res 50: 125-131.
7. Altman E (2000). Applications of Markov decision processes in communication networks: a survey. Rapport de Recherhe 3984, INRIA.
8. Foster I and Kesselman C (eds) (1998). The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufman: San Francisco.
9. Braun TD, Siegel HJ, and Maciejewski AA. (2001) Heterogeneous computing: goals, methods and open problems. "PDPTA 2001: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, (ed. Arabnia HR), pp 1-12. CSREA: Athens".
10. Becker K J, Gaver DP, Glazebrok KD, Jacobs PA and Lawphongpanich S (2000). Allocation of tasks to specialized processors: a planning approach. Eur J Opl Res 126: 80-88.
11. Schwartz B (1974). Queueing models with lane selection: a new class of problems. Opns Res 22: 331-339.
12. Green L (1985). A queueing system with general-use and limited-use servers. Opns Res 33: 168-182.
13. Ross KW and Yao DD (1991). Optimal load balancing and scheduling in a distributed computer system. J Assoc Comput Mach 38: 676-690.
14. Dacre M J, Glazebrook KD and Niño-Mora J (1999). The achievable region approach to the optimal control of stochastic systems (with discussion). J R Stat Soc B 61: 747-791.
15. Puterman ML (1994). Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley: New York.
16. Krishan KR (1987) Joining the right queue: a Markov decision rule. In: Proceedings of the 28th IEEE Conference on Decision and Control, pp 1863-1868.
17. Tijms HC (1994). Stochastic Models: an Algorithmic Approach. Wiley: Chichester.
18. Ansell PS, Dacre MJ, Glazebrook KD and Kirkbride C (2000). Optimal load balancing and scheduling in distributed multi-class service systems. Technical Report, Newcastle University.
19. Hajek B (1985). Extremal splittings of point processes. Math Opns Res 10: 543-556.