Title :
Optimal scheduling for multiclass queues with blocking
Author :
Mukerjee, M.R. ; Ali, Borhanuddin Mohd ; Khalil, Ibrahim
Author_Institution :
Dept. of Electron. & Comput. Eng., Pertanian Malaysia Univ., Selangor, Malaysia
Abstract :
A problem of optimal scheduling of multiple queues competing for service at a single station is considered, where each queue has a finite buffer and the service may be class dependent. The cost is linear in the number of waiting customers and also includes the cost of customers lost due to blocking upon arrival to a full queue. The scheduling problem is solved by converting to a discrete Markov decision problem and using dynamic programming. It is shown that for a broad range of costs, the optimal policy is of the threshold or switching type
Keywords :
Markov processes; buffer storage; decision theory; dynamic programming; queueing theory; scheduling; telecommunication congestion control; blocking; cost; discrete Markov decision problem; dynamic programming; finite buffer; multiclass queues; multiple queues; optimal scheduling; service; single station; switching policy; threshold policy; waiting customers; Context modeling; Context-aware services; Control system synthesis; Cost function; Dynamic programming; Dynamic scheduling; Infinite horizon; Optimal scheduling; Poisson equations; Upper bound;
Conference_Titel :
Singapore ICCS '94. Conference Proceedings.
Print_ISBN :
0-7803-2046-8
DOI :
10.1109/ICCS.1994.474251
