Optimal admission control in two-class preemptive loss systems

Abstract We study optimal admission control in a two-class preemptive loss system. A class-1 customer arrival aborts service of a class-2 customer if the system is full upon arrival. Each successfully serviced class-2 customer leads to a reward, whereas each aborted class-2 customer incurs a cost. Using dynamic programming, we characterize optimal admission control for class-2 customers that maximizes the long-run average profit. The optimal admission control policy depends only on the total occupancy and is of threshold type.

[1]  David Starobinski,et al.  Optimal admission control of secondary users in preemptive cognitive radio networks , 2012, 2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt).

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

[3]  Susan H. Xu,et al.  Optimal Expulsion Control - A Dual Approach to Admission Control of an Ordered-Entry System , 1993, Oper. Res..

[4]  Gajf Gido Brouns.  Queueing models with admission and termination control : monotonicity and threshold results , 2003 .

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

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

[7]  Noah Gans,et al.  Pricing and Capacity Rationing for Rentals with Uncertain Durations , 2007, Manag. Sci..

[8]  David Starobinski,et al.  On-line Pricing of Secondary Spectrum Access with Unknown Demand Function and Call Length Distribution , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Aylin Turhan.  Admission control and pricing of secondary users in preemptive communication networks , 2012 .

[10]  Steven P. Weber,et al.  Admission control and preemption policy design of multi-class computer networks , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[11]  Steven P. Weber,et al.  Preemption rates for a parallel link loss network , 2009, Perform. Evaluation.

[12]  Jean C. Walrand,et al.  An introduction to queueing networks , 1989, Prentice Hall International editions.

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

[14]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[15]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[16]  Refik Güllü,et al.  Admission and Termination Control of a Two Class Loss System , 2011 .

[17]  Don Towsley,et al.  On optimal call admission control in cellular networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[18]  Walter Helly.  Letter to the Editor—Two Doctrines for the Handling of Two-Priority Traffic by a Group of N Servers , 1962 .

[19]  Jan van der Wal,et al.  Optimal threshold policies in a two-class preemptive priority queue with admission and termination control , 2006, Queueing Syst. Theory Appl..

[20]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .