Marginal productivity index policies for admission control and routing to parallel multi-server loss queues with reneging

  • Authors:
  • José Niño-Mora

  • Affiliations:
  • Universidad Carlos III de Madrid, Department of Statistics, Getafe, Madrid, Spain

  • Venue:
  • NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the problem of designing tractable dynamic admission control and/or routing policies in a Markovian model of parallel multi-server loss queues with reneging, which seek to optimize performance objectives of concern. Such problems are relevant in a variety of systems that provide distributed telecommunication or computing services. The paper shows the direct applicability of the author's results in Niño-Mora (2002) [Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Math. Program. 93 361-413], where index policies based on restless bandits were developed in a broader setting. A well-grounded and tractable index policy for admission control and/or routing is thus proposed for the model of concern. Results of preliminary computational experiments are reported, showing that the proposed index policy is nearly optimal, and substantially out-performs conventional benchmark policies in the instances investigated.