Optimal sleep-state control of energy-aware M/G/1 queues
Journal Title: EAI Endorsed Transactions on Internet of Things - Year 2015, Vol 1, Issue 4
Abstract
We study the problem of optimally controlling the use of sleep states in an energy-aware M/G/1 queue. In our model, we consider a family of policies where the server upon becoming idle can wait for a random period before entering, potentially randomly, any of a finite number of possible sleep states to save energy. The server becomes busy again after a possibly random number of jobs have arrived. However, jobs are served only after a random setup time. This kind of an energy-aware queuing system has been analyzed in recent papers under specifi c assumptions regarding the cost metrics and the distributions of the random variables. In this paper, we consider an essentially more general model. Notably we show that the optimal control of the idle time and sleep states is deterministic and does not benefi t from randomization: either the system only uses the idle state and no sleep states, or the idle state is not used at all and the server immediately goes to some fixed sleep state and waits until a fixed number of jobs have arrived before starting the setup. We prove this result for two popular cost metrics, namely weighted sum of energy and response time (ERWS) and their product ERP.
Authors and Affiliations
Misikir Eyob Gebrehiwot, Samuli Aalto, Pasi Lassila
Keywords
Related Articles
- EP ID EP46470
- DOI http://dx.doi.org/10.4108/icst.valuetools.2014.258149
- Views 307
- Downloads 0
Securing the Timestamping of Sensor Data from Wearable Healthcare Devices
An ageing population, coupled with increasing prevalence of chronic diseases, is placing unsustainable demands on current healthcare systems. Home-based medical monitoring, supported by wearable sensors for heart-rate, E...
End-to-End Delay Bounds for Variable Length Packet Transmissions under Flow Transformations
A fundamental contribution of network calculus is the convolution-form representation of networks which enables tight end-to-end delay bounds. Recently, this has been extended to the case where the data flow is subject t...
Powering environment monitoring Wireless Sensor Networks: A review of design and operational challenges in Eastern Africa
This paper discusses the various design and operational challenges that we have met in providing power to Wireless Sensor Networks (WSNs) deployed in environment monitoring in East Africa. While such deployments in Afric...
A heuristic procedure for compact Markov representation of PH distributions
The minimal Markovian representation of PH distributions is an open research problem, which was actively investigated during the last two decades. We present a numerical method for finding small Markovian representation...
On mean waiting time completeness and equivalence of EDD and HOL-PJ dynamic priority in 2-class M/G/1 queue
This paper identifies two different parametrized dynamic priority queue disciplines, earliest due date (EDD) based and head of line priority jump (HOL-PJ), which are found to be mean waiting time complete in two class M/...