QoS-aware energy-efficient workload routing and server speed control policy in data centers: a robust queueing theoretic approach

TL;DR

This paper introduces a static workload routing and server speed control policy for data centers that achieves energy efficiency comparable to dynamic algorithms without requiring frequent communication, using a robust queueing theoretic approach.

Contribution

It proposes a static control policy based on robust queueing theory that matches dynamic algorithms' energy efficiency while reducing communication overhead.

Findings

Static policy achieves similar energy efficiency to dynamic algorithms.

The approach effectively estimates response time quantiles for QoS.

Numerical results confirm the policy's competitiveness.

Abstract

Operating cloud service infrastructures requires high energy efficiency while ensuring a satisfactory service level. Motivated by data centers, we consider a workload routing and server speed control policy applicable to the system operating under fluctuating demands. Dynamic control algorithms are generally more energy-efficient than static ones. However, they often require frequent information exchanges between routers and servers, making the data centers' management hesitate to deploy these algorithms. This study presents a static routing and server speed control policy that could achieve energy efficiency similar to a dynamic algorithm and eliminate the necessity of frequent communication among resources. We take a robust queueing theoretic approach to response time constraints for the quality of service (QoS) conditions. Each server is modeled as a G/G/1 processor sharing queue, and the concept of uncertainty sets defines the domain of stochastic primitives. We derive an approximative upper bound of sojourn times from uncertainty sets and develop an approximative sojourn time quantile estimation method for QoS. Numerical experiments confirm the proposed static policy offers competitive solutions compared with the dynamic algorithm.