Conference Proceeding

Energy-aware scheduling algorithms for network stability

Bell Labs., Murray Hill, NJ, USA
Proceedings - IEEE INFOCOM 05/2011; DOI:10.1109/INFCOM.2011.5934920 pp.1359 - 1367 In proceeding of: INFOCOM, 2011 Proceedings IEEE
Source: IEEE Xplore

ABSTRACT A key problem in the control of packet-switched data networks is to schedule the data so that the queue sizes remain bounded over time. Scheduling algorithms have been developed in a number of different models that ensure network stability as long as no queue is inherently overloaded. However, this literature typically assumes that each server runs at a fixed maximum speed. Although this is optimal for clearing queue backlogs as fast as possible, it may be suboptimal in terms of energy consumption. Indeed, a lightly loaded server could operate at a lower rate, at least temporarily, to save energy. Within an energy-aware framework, a natural question arises: "What is the minimum energy that is required to keep the network stable?" In this paper, we demonstrate the following results towards answering that question. Starting with the simplest case of a single server in isolation, we consider three types of rate adaptation policies: a heuristic policy, which sets server speed depending on queue size only, and two more complex ones that exhibit a tradeoff between queue size and energy usage. We also present a lower bound on the best such tradeoff that can possibly be achieved. Next, we study a general network environment and investigate two scenarios. In a temporary sessions scenario, where connection paths can rapidly change over time, we propose a combination of the above rate adaptation policies with the standard Farthest-to Go scheduling algorithm. This approach provides stability in the network setting, while using an amount of energy that is within a bounded factor of the optimum. In a permanent sessions scenario, where connection paths are fixed, we examine an analogue of the well-known Weighted Fair Queueing scheduling policy and show how delay bounds are affected under rate adaptation.

0 0
·
0 Bookmarks
·
39 Views
• Article:Universal-Stability Results and Performance Bounds for Greedy Contention-Resolution Protocols
[show abstract] [hide abstract]
ABSTRACT: In this paper, we analyze the behavior of packet-switched communication networks in which packets arrive dynamically at the nodes and are routed in discrete time steps across the edges. We focus on a basic adversarial model of packet arrival and path determination for which the time--averaged arrival rate of packets requiring the use of any edge is limited to be less than 1. This model can reflect the behavior of connection-oriented networks with transient connections (such as ATM networks) as well as connectionless networks (such as the Internet). Supported by Army grant DAAH04-95-1-0607 and ARPA contract N00014-95-1-1246. y Laboratory for Computer Science, MIT. Supported by NSF contract 9302476-CCR. Current address: Bell Laboratories, 600-700 Mountain Avenue, Murray Hill, NJ 07974. z Department of Computer Science, Johns Hopkins University. x Laboratory for Computer Science, MIT. Current address: Escuela Superior de Ciencias Experimentales y Tecnolog'ia, Universidad Rey Juan...
07/1999;
• Article:The Effects of Temporary Sessions on Network Performance
[show abstract] [hide abstract]
ABSTRACT: We consider a packet network, in which packets are injected in sessions along fixed paths.
07/1999;
• Source
Article:Speed Scaling with an Arbitrary Power Function
[show abstract] [hide abstract]
ABSTRACT: All of the theoretical speed scaling research to date has assumed that the power function, which expresses the power consumption $P$ as a function of the processor speed $s$, is of the form $P=s^\alpha$, where $\alpha > 1$ is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary power functions. We consider the problem of minimizing the total flow plus energy. Our main result is a $(3+\epsilon)$-competitive algorithm for this problem, that holds for essentially any power function. We also give a $(2+\epsilon)$-competitive algorithm for the objective of fractional weighted flow plus energy. Even for power functions of the form $s^\alpha$, it was not previously known how to obtain competitiveness independent of $\alpha$ for these problems. We also introduce a model of allowable speeds that generalizes all known models in the literature.
Mathieu, Claire: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM Press, 693-701 (2009).

0 Downloads
Available from

Keywords

ensure network stability

Fair Queueing scheduling policy

fixed maximum speed

following results

heuristic policy

key problem

lower rate

minimum energy

natural question

network stable

packet-switched data networks

permanent sessions scenario

queue backlogs

queue sizes

rate adaptation

rate adaptation policies

scheduling algorithm

server runs

simplest case

temporary sessions scenario