 Threshold properties of the M/M/1 queue under T-policy with applicationsXuelu Zhang, Jinting Wang and Tien Van Do Applied Mathematics and Computation, 2015, vol. 261, issue C, 284-301 Abstract: In this paper, we consider a single server queueing system with a threshold control policy and its application for controlling the energy consumption of a computing server. If the number of customers in the system is less than a threshold, the service rate is set in a low value and it also can be switched to a high value once the number of customers reaches the threshold. We study the monotonicity, convexity or concavity properties of the key performance measures of the system such as the steady-state probability distribution, the expected number of customers in the system and in the queue, the expected sojourn time in the system and the waiting time in the queue, with respect to the threshold. Based on these properties, we further study a real-life problem regarding the energy consumption of a computing server. Numerical results show that the state-dependent service policy is a promising technique to balance the energy consumption and the quality of service of a computing server. Keywords: Queueing system; Monotonicity; Convexity or concavity; State-dependent service rate; Cost conservation (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:261:y:2015:i:c:p:284-301 DOI: 10.1016/j.amc.2015.03.109 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.