Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-24T10:26:18.485Z Has data issue: false hasContentIssue false
  • English
  • Français

The cμ rule revisited

Published online by Cambridge University Press:  01 July 2016

C. Buyukkoc ,
P. Varaiya  and
J. Walrand
C. Buyukkoc*
Affiliation:
University of California, Berkeley
P. Varaiya*
Affiliation:
University of California, Berkeley
J. Walrand*
Affiliation:
University of California, Berkeley
*
∗Postal address: Department of Electrical Engineering and Computer Sciences and Electronics Research Laboratory, University of California, Berkeley, CA 94720, USA.
∗Postal address: Department of Electrical Engineering and Computer Sciences and Electronics Research Laboratory, University of California, Berkeley, CA 94720, USA.
∗Postal address: Department of Electrical Engineering and Computer Sciences and Electronics Research Laboratory, University of California, Berkeley, CA 94720, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The cμ rule is optimal for arbitrary arrival processes provided that the service times are geometric and the service discipline is preemptive.

Type
Letters to the Editor
Information
Advances in Applied Probability , Volume 17 , Issue 1 , March 1985 , pp. 237 - 238
Copyright
Copyright © Applied Probability Trust 1985 

Footnotes

Research supported by Office of Naval Research Contract N00014-80-C-0507 and NSF Grant No. ECS-8205428.

References

1. Baras, J. S., Dorsey, A. J. and Makowski, A. M. (1985) Two competing queues with linear costs: The µc rule is often optimal. Adv. Appl. Prob. 17, 186–209.CrossRefGoogle Scholar
2. Varaiya, P., Walrand, J. and Buyukkoc, C. Extensions of the multi-armed bandit problem. IEEE Trans. Automatic Control. Google Scholar