Rate-adaptive weighted fair queueing for energy-aware scheduling》.pdf

Information Processing Letters 114 (2014) 247–251 Contents lists available at ScienceDirect Information Processing Letters /locate/ipl Rate-adaptive weighted fair queueing for energy-aware scheduling Matthew Andrews, Lisa Zhang ∗ Bell Labs, 600 Mountain Ave, Murray Hill, NJ 07974, United States a r t i c l e i n f o a b s t r a c t Article history: In this paper we study energy-aware scheduling that trades energy consumption against Received 15 March 2013 a traditional performance measure of delay. We use the power-rate function f (x) = c + Received in revised form 9 December 2013 xα for x 0 and f (0) = 0 to model the power consumption, where c 0 represents the Accepted 17 December 2013 base power. We give a definition of a rate-adaptive version of the Weighted Fair Queueing Available online 19 December 2013 scheduling algorithm, and prove its energy consumption is within a bounded factor of Communicated by M. Chrobak the best possible when the algorithm guarantees the classic end-to-end delay for every Keywords: connection. Delay-energy tradeoff © 2013 Elsevier B.V. All rights reserved. Scheduling Rate-adaptive weighted fair queueing 1. Introduction netwo