Optimality of randomized trunk reservation for a problem with a single constraint

We study an optimal admission of arriving customers to a Markovian finite-capacity queue, e.g. an M/M/c/N queue, with several customer types. The system managers are paid for serving customers and penalized for rejecting them. The rewards and penalties depend on customer type. The goal is to maximize the average rewards per unit time subject to the constraint on the average penalties per unit time. We provide a solution to this problem based on Lagrangian optimization. For a feasible problem, we show the existence of a randomized trunk reservation optimal policy with the acceptance thresholds for different customer types ordered according to a linear combination of the service rewards and rejection costs. In addition, we prove that any 1-randomized stationary optimal policy has this structure. In particular, we establish the structure of an optimal policy that maximizes the average rewards per unit time subject to the constraint on the blocking probability of either one of the customer types or a group of customer types pooled together.

[1]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[2]  Bruce L. Miller,et al.  A Queueing Reward System with Several Customer Classes , 1969 .

[3]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[4]  Steven A. Lippman,et al.  Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..

[5]  Michael J. Magazine,et al.  A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[6]  Jr. Shaler Stidham.  Optimal control of admission to a queueing system , 1985 .

[7]  Peter Key,et al.  Optimal Control and Trunk Reservation in Loss Networks , 1990 .

[8]  David D. Yao,et al.  Monotonicity properties for the stochastic knapsack , 1990, IEEE Trans. Inf. Theory.

[9]  F. P. Kelly,et al.  Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..

[10]  Viên Nguyen.  On the Optimality of Trunk Reservation in Overflow Processes , 1991 .

[11]  Eugene A. Feinberg,et al.  Constrained Semi-Markov decision processes with average rewards , 1994, Math. Methods Oper. Res..

[12]  M. Reiman,et al.  Optimality of Randomized Trunk Reservation , 1994 .

[13]  J. Papastavrou,et al.  The Dynamic and Stochastic Knapsack Problem with Deadlines , 1996 .

[14]  C. Laws,et al.  Optimization via trunk reservation in single resource loss systems under heavy traffic , 1997 .

[15]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[16]  Anatolii A. Puhalskii,et al.  A critically loaded multirate link with trunk reservation , 1998, Queueing Syst. Theory Appl..

[17]  Eduardo Conde,et al.  Admission Policies in Loss Queueing Models with Heterogeneous Arrivals , 1998 .

[18]  Hayriye Ayhan,et al.  BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL , 1999, Probability in the Engineering and Informational Sciences.

[19]  Eitan Altman,et al.  Applications of Markov Decision Processes in Communication Networks , 2000 .

[20]  Eitan Altman,et al.  On optimal call admission control in resource-sharing system , 2001, IEEE Trans. Commun..

[21]  M. Lewis.  Average optimal policies in a controlled queueing system with dual admission control , 2001, Journal of Applied Probability.

[22]  Hayriye Ayhan,et al.  Bias optimal admission control policies for a multiclass nonstationary queueing system , 2002, Journal of Applied Probability.

[23]  E. Feinberg.  Optimal control of average reward constrained continuous-time finite Markov decision processes , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[24]  Sheldon M. Ross,et al.  Admission Control with Incomplete Information of a Queueing System , 2003, Oper. Res..

[25]  Alexei B. Piunovskiy.  Bicriteria Optimization of a Queue with a Controlled Input Stream , 2004, Queueing Syst. Theory Appl..

[26]  Sheldon M. Ross,et al.  Optimal admission control for a single-server loss queue , 2004, Journal of Applied Probability.

[27]  Eugene A. Feinberg,et al.  Continuous Time Discounted Jump Markov Decision Processes: A Discrete-Event Approach , 2004, Math. Oper. Res..

[28]  Eugene A. Feinberg,et al.  On essential information in sequential decision processes , 2005, Math. Methods Oper. Res..