Rate-adaptive weighted fair queueing for energy-aware scheduling

In this paper we study energy-aware scheduling that trades energy consumption against a traditional performance measure of delay. We use the power-rate function f(x) = c + x(alpha) for x > 0 and f(0) = 0 to model the power consumption, where c > 0 represents the base power. We give a definition of a rate-adaptive version of the Weighted Fair Queueing scheduling algorithm, and prove its energy consumption is within a bounded factor of the best possible when the algorithm guarantees the classic end-to-end delay for every connection. (C) 2013 Elsevier B.V. All rights reserved.