Asymptotically optimal index policies for an abandonment queue with convex holding cost.

Maialen Larrañaga 1 Urtzi Ayesta 1 Ina Maria Verloop 2
1 LAAS-SARA - Équipe Services et Architectures pour Réseaux Avancés
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
2 IRT
IRIT - Institut de recherche en informatique de Toulouse
Abstract : We investigate a resource allocation problem in a multi-class server with convex holding costs and user impatience under the average cost criterion. In general, the optimal policy has a complex dependency on all the input parameters and state information. Our main contribution is to derive index policies that can serve as heuristics and are shown to give good performance. Our index policy attributes to each class an index, which depends on the number of customers currently present in that class. The index values are obtained by solving a relaxed version of the optimal stochastic control problem and combining results from restless multi-armed bandits and queueing theory. They can be expressed as a function of the steady-state distribution probabilities of a one-dimensional birth-and-death process. For linear holding cost, the index can be calculated in closed-form and turns out to be independent of the arrival rates and the number of customers present. In the case of no abandonments and linear holding cost, our index coincides with the $c\mu$-rule, which is known to be optimal in this simple setting. For general convex holding cost we derive properties of the index value in limiting regimes: we consider the behavior of the index (i) as the number of customers in a class grows large, which allows us to derive the asymptotic structure of the index policies, (ii) as the abandonment rate vanishes, which allows us to retrieve an index policy proposed for the multi-class M/M/1 queue with convex holding cost and no abandonments, and (iii) as the arrival rate goes to either 0 or $\infty$, representing light-traffic and heavy-traffic regimes, respectively. We show that Whittle's index policy is asymptotically optimal in both light-traffic and heavy-traffic regimes. To obtain further insights into the index policy, we consider the fluid version of the relaxed problem and derive a closed-form expression for the fluid index. The latter is shown to coincide with the index values for the stochastic model in asymptotic regimes. For arbitrary convex holding cost the fluid index can be seen as the $Gc\mu/\theta$-rule, that is, including abandonments into the generalized $c\mu$-rule ($Gc\mu$-rule). Numerical experiments for a wide range of parameters have shown that the Whittle index policy and the fluid index policy perform very well for a broad range of parameters.
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01064370
Contributor : Maialen Larranaga <>
Submitted on : Tuesday, June 23, 2015 - 1:53:39 PM
Last modification on : Thursday, October 17, 2019 - 8:55:08 AM
Long-term archiving on : Tuesday, April 25, 2017 - 5:47:15 PM

File

LAV2015 (1).pdf
Files produced by the author(s)

Identifiers

Citation

Maialen Larrañaga, Urtzi Ayesta, Ina Maria Verloop. Asymptotically optimal index policies for an abandonment queue with convex holding cost.. Queueing Systems, Springer Verlag, 2015, 81 (2), pp.99-169. ⟨10.1007/s11134-015-9445-y⟩. ⟨hal-01064370v2⟩

Share

Metrics

Record views

372

Files downloads

293