Abstract
This paper studies a control problem for optimal switching on and off a cloud computing services modeled by an M=M=1 queue with holding, running and switching costs. The main result is that an average-optimal policy either always runs the system or is an (M; N)-policy defined by two thresholds M and N, such that the system is switched on upon an arrival epoch when the system size accumulates to N and it is switched off upon a departure epoch when the system size decreases to M. We compare the optimal (M; N)-policy with the classical (0; N)-policy and show the non-optimality of it.
| Original language | English |
|---|---|
| Pages (from-to) | 57-60 |
| Number of pages | 4 |
| Journal | Performance Evaluation Review |
| Volume | 41 |
| Issue number | 4 |
| DOIs | |
| State | Published - Mar 2014 |
Keywords
- Cloud computing
- M/M/∞
- Markov decision process
- Queueing control
Fingerprint
Dive into the research topics of 'Optimizing cloud utilization via switching decisions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver