Title :
Optimization in a class of priority-discarding policies for finite queues
Author_Institution :
Dept. of Electr. & Comput. Eng., Kansas Univ., Lawrence, KS, USA
fDate :
5/1/1994 12:00:00 AM
Abstract :
Considers an optimization problem for finite queues governed by priority-discarding control policies. The author develops an analytical model for systems that defer discarding decisions until service completion instants, but then may expel any waiting jobs. Using stochastic dynamic programming techniques, the author obtains closed-form optimization results for systems constrained to retain at most one job. Numerical performance examples are included
Keywords :
dynamic programming; queueing theory; stochastic programming; analytical model; closed-form optimization; finite queues; priority-discarding policies; service completion; stochastic dynamic programming; Analytical models; Communication networks; Constraint optimization; Cost function; Dynamic programming; Heuristic algorithms; Network servers; Stochastic processes; Stochastic systems; Sufficient conditions;
Journal_Title :
Automatic Control, IEEE Transactions on
