Title: GreenNFV: Energy-Efficient Network Function Virtualization with Service Level Agreement Constraints
Network Function Virtualization (NFV) platforms consume significant energy, introducing high operational costs in edge and data centers. This paper presents a novel framework called GreenNFV that optimizes resource usage for network function chains using deep reinforcement learning. GreenNFV optimizes resource parameters such as CPU sharing ratio, CPU frequency scaling, last-level cache (LLC) allocation, DMA buffer size, and packet batch size. GreenNFV learns the resource scheduling model from the benchmark experiments and takes Service Level Agreements (SLAs) into account to optimize resource usage models based on the different throughput and energy consumption requirements. Our evaluation shows that GreenNFV models achieve high transfer throughput and low energy consumption while satisfying various SLA constraints. Specifically, GreenNFV with Throughput SLA can achieve 4.4× higher throughput and 1.5× better energy efficiency over the baseline settings, whereas GreenNFV with Energy SLA can achieve 3× higher throughput while reducing energy consumption by 50%.  more » « less
Award ID(s):
2007829
PAR ID:
10565485
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
ACM
Date Published:
ISBN:
9798400701092
Page Range / eLocation ID:
1 to 12
Subject(s) / Keyword(s):
Network function virtualization energy efficiency performance service level agreements deep reinforcement learning.
Format(s):
Medium: X
Location:
Denver CO USA
Sponsoring Org:
National Science Foundation
More Like this
  1. Dynamic stream processing in cloud environments presents unique challenges due to fluctuating data rates, heterogeneous workloads, and constrained resource availability. Traditional static and heuristic-based resource allocation techniques often fail to adapt effectively to these real-time dynamics, leading to suboptimal throughput, excessive latency, and violation of service-level agreements (SLAs). In this paper, we propose a Hierarchical Multi-Agent Deep Reinforcement Learning (H-MADRL) framework to address these limitations through autonomous, data-driven adaptation. Our system integrates Proximal Policy Optimization (PPO) agents with Kubernetes orchestration and Graph Neural Networks (GNNs) for topology-aware scaling decisions. Experiments under simulated and live workloads demonstrate the PPO agent's ability to maintain stable performance during load surges up to 5,000 events/sec without over-provisioning. Comparative evaluation with heuristic rule-based methods shows that the proposed DRL-based framework improves elasticity and responsiveness by up to 35% lower latency and 22% higher throughput, particularly under bursty or deceptive low-CPU workloads where heuristics fail to detect overload. Furthermore, the DRL agent consistently optimizes resource utilization, reducing unnecessary replica scaling while maintaining SLA targets. The system's reward function jointly balances throughput maximization, latency reduction, and cost efficiency, providing a robust alternative to traditional methods. 
    more » « less
  2. Network Function Virtualization seeks to run high performance middleboxes in a flexible, more configurable software environment. Even with advances such as kernel bypass and zero-copy IO, middlebox platforms still struggle to meet stringent throughput and latency requirements. To achieve line rates as network bandwidths rise, these platforms often must make tradeoffs such as inefficiently dedicating more CPU cores or weakening security and isolation properties. In this paper we explore how advances in programmable “smart NICs” can be leveraged by software middlebox platforms to improve performance, resource efficiency, and security. Our evaluation shows several use cases for smart NICs, which improve performance significantly while reducing resource consumption and providing strong isolation. 
    more » « less
  3. Efficient resource scheduling in cloud computing is crucial for maintaining service quality while optimizing infrastructure costs. However, dynamic workloads and varying user demands make virtual machine (VM) placement and resource management highly complex. Efficient resource scheduling remains a significant challenge. Over-provisioning leads to wastage, while under-provisioning can cause performance degradation and service level agreement (SLA) violations. In this paper, we propose an explainable machine learning (ML)-based approach to predict VM resource demand to enhance placement decisions and achieve high resource utilization in clouds. We train an XGBoost regression model to predict CPU demand based on historical usage data. Also, we employ SHAP (SHapley Additive exPlanations) to interpret the model's predictions and uncover key decision-driving features. To evaluate our approach, we experimented with a real-world workload from the Google Cluster Workload Trace. Experimental results demonstrate improved prediction accuracy and model transparency, offering a practical and interpretable solution for intelligent VM scheduling in real-world cloud environments. 
    more » « less
  4. This paper presents a comparative performance analysis of three popular Python data manipulation libraries—Pandas, Polars, and Dask—within the context of deep learning training pipelines. The existing studies in this area do not embed the libraries inside a full deep-learning training pipeline where data loading, preprocessing, and batch feeding interact tightly with GPU workloads. To bridge this gap, we integrate Pandas, Polars, and Dask into representative deep learning training and inference pipelines and conduct experi- ments across a wide range of various machine learning models and datasets, measuring key performance indicators such as runtime, memory usage, disk usage, and energy consumption (CPU and GPU). Our comprehensive analysis reveals that Polars consistently minimizes CPU energy consumption on larger workloads, while Pandas remains competitive for moderate sizes. Dask’s overhead can lead to higher energy usage on small to moderate datasets. All three libraries achieve similar runtimes for heavy GPU workloads (ResNet, Mask R-CNN). Polars and Pandas maintain lower CPU memory footprints than Dask, but Dask offers easier scalability if data truly exceeds available RAM. Polars shows marginal energy savings on the CPU during preprocessing. 
    more » « less
  5. This paper presents a comparative performance analysis of three popular Python data manipulation libraries—Pandas, Polars, and Dask—within the context of deep learning training pipelines. The existing studies in this area do not embed the libraries inside a full deep-learning training pipeline where data loading, preprocessing, and batch feeding interact tightly with GPU workloads. To bridge this gap, we integrate Pandas, Polars, and Dask into representative deep learning training and inference pipelines and conduct experiments across a wide range of various machine learning models and datasets, measuring key performance indicators such as runtime, memory usage, disk usage, and energy consumption (CPU and GPU). Our comprehensive analysis reveals that Polars consistently minimizes CPU energy consumption on larger workloads, while Pandas remains competitive for moderate sizes. Dask’s overhead can lead to higher energy usage on small to moderate datasets. All three libraries achieve similar runtimes for heavy GPU workloads (ResNet, Mask R-CNN). Polars and Pandas maintain lower CPU memory footprints than Dask, but Dask o"ers easier scalability if data truly exceeds available RAM. Polars shows marginal energy savings on the CPU during preprocessing. 
    more » « less