Author:
Buyukkoc C.,Varaiya P.,Walrand J.
Abstract
The cμ rule is optimal for arbitrary arrival processes provided that the service times are geometric and the service discipline is preemptive.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference2 articles.
1. Two competing queues with linear costs: The µc rule is often optimal;Baras;Adv. Appl. Prob.,1985
2. . Varaiya P. , Walrand J. and Buyukkoc C. Extensions of the multi-armed bandit problem. IEEE Trans. Automatic Control.
Cited by
181 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献