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 outperforms conventional benchmark policies in the instances investigated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bassamboo, A., Harrison, J.M., Zeevi, A.: Dynamic routing and admission control in high-volume service systems: asymptotic analysis via multi-scale fluid limits. Queueing Syst. 51, 249–285 (2005)
Hordijk, A., Koole, G.: On the optimality of the generalized shortest queue policy. Probab. Eng. Inf. Sci. 4, 477–487 (1990)
Houck, D.J.: Comparison of policies for routing customers to parallel queueing sytems. Oper. Res. 35, 306–310 (1987)
Johri, P.K.: Optimality of the shortest line discipline with state-dependent service rates. European J. Oper. Res. 41, 157–161 (1989)
Niño-Mora, J.: Restless bandits, partial conservation laws and indexability. Adv. in Appl. Probab. 33, 76–98 (2001)
Niño-Mora, J.: Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Math. Program. 93, 361–413 (2002a)
Niño-Mora, J.: Admission control and routing to parallel queues via Whittle’s restless bandit index policy. In: Workshop on Topics in Computer Communication and Networks, Isaac Newton Institute for Mathematical Sciences, Cambridge Univ., UK (2002b), available at http://www.newton.cam.ac.uk/webseminars/pg+ws/2002/CMPW03/1217/nino-mora/
Niño-Mora, J.: Restless bandit marginal productivity indices, diminishing returns and optimal control of make-to-order/make-to-stock M/G/1 queues. Math. Oper. Res. 31, 50–84 (2006a)
Niño-Mora, J.: Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue. Queueing Syst. 54, 281–312 (2006b)
Palm, C.: Contributions to the theory of delay systems. Tele 1, 37–67 (1957)
Whittle, P.: Restless bandits: Activity allocation in a changing world. J. Gani (ed.), J. Appl. Probab. 25A, 287–298 (1988)
Winston, W.: Optimality of the shortest line discipline. J. Appl. Probab. 14, 181–189 (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niño-Mora, J. (2007). Marginal Productivity Index Policies for Admission Control and Routing to Parallel Multi-server Loss Queues with Reneging. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-72709-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72708-8
Online ISBN: 978-3-540-72709-5
eBook Packages: Computer ScienceComputer Science (R0)