Dong Jin, Xiaoxuan Zhang, et al.
ISGT 2012
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.
Dong Jin, Xiaoxuan Zhang, et al.
ISGT 2012
Xiaoxuan Zhang
IEEE Trans. Sustainable Energy
Shivaram Subramanian, Soumyadip Ghosh, et al.
SmartGridComm 2013
Soumyadip Ghosh, Xu Andy Sun, et al.
ISGT ASIA 2012