Comments on: Dynamic priority allocation via restless bandit marginal productivity indices 2
-
Eitan Altman [1]
-
[1] French Institute for Research in Computer Science and Automation
French Institute for Research in Computer Science and Automation
Arrondissement de Versailles, Francia
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 15, Nº. 2, 2007, págs. 202-207
- Idioma: inglés
- DOI: 10.1007/s11750-007-0027-y
- Enlaces
-
Resumen
Queueing theory in general, and the optimal control of queues, in particular, are well developed for the case of a single server and two servers, but becomes intractable for many problems in higher dimensions. Standard methods for handling two queues, such as boundary value techniques (Cohen and Boxma 1983), or matrix geometric methods (Neuts 1981) do not extend to dimension 3 or higher. The structure of threshold and switching curve policies that characterizes optimal policies in many problems (such as admission control and routing) in dimension one and two, respectively, is usually lost for networks with more than two queues.
The analysis and control of priority in queues are one of the successes of queueing theory in going beyond the frontier of dimension two, and Jose Niño-Mora has been among the leaders of these advances. Niño-Mora (2007) summarizes more than a decade of his research in that topic to which he has devoted his career since his first steps in his Ph.D.
The main objectives I have chosen for this discussion note are
