Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.13879

A measurement-based approach to analyze the power consumption of the softwarized 5G core

Arturo Bellin·Fabrizio Granelli·Daniele Munaretto
View original source ↗Read source document ↗Export metadata ↓

Abstract

In light of the ever growing energy needs of the ICT sector, a value that is becoming increasingly important for a mobile network is its power consumption. However, the transition away from legacy network deployments tightly coupled with the underlying hardware and the adoption of the Network Function Virtualization (NFV) paradigm has made more difficult to accurately evaluate their energy and carbon footprint. In this paper, we propose and validate a measurement-based approach to analyze the power consumption of a virtualized 5G core network (5GC) deployment. We design an experimental testbed using commercial off-the-shelf (COTS) hardware and open-source software as a sample architecture simulating an edge computing node and supporting three different virtualization options. We make use of both hardware-based and software-based power meters to investigate the power consumption trends associated with increasing levels of traffic and multiple 5GC deployment types. The results show the feasibility of a real-time power monitoring system and highlight how deployment choices, such as virtualization framework and 5GC software, can significantly impact on the power consumption of the network.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arturo Bellin, Fabrizio Granelli, Daniele Munaretto. 2025-02-19. A measurement-based approach to analyze the power consumption of the softwarized 5G core. https://doi.org/10.1016/j.comnet.2024.110312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Age-Optimal Target Wake Time: Provably Good Wake Schedules for Energy-Constrained Wi-Fi Status Updating

Target Wake Time (TWT), introduced in IEEE 802.11ax, lets an access point schedule exactly when each station wakes, transmits, and dozes. Existing TWT schedulers optimize energy or throughput, treating information freshness at best as a constraint and offering no performance guarantees. We design the wake schedule itself for freshness: minimize the weighted average Age of Information (AoI) over stations subject to per-station energy budgets, where the decision variables are the TWT triples (wake interval, offset, service period duration). We derive a renewal-exact AoI model for TWT under per-SP block fading and validate it against packet-level 802.11ax simulation with ~1% mean error. We show that, unlike preemptive scheduling, non-preemptive TWT packing can be infeasible at schedule density 1, and identify the granularity condition under which a small-first best-fit packer provably succeeds. Around this we build Harmonic-Greedy, a scheduler combining a convex relaxation, anchor-optimized power-of-two rounding, and a best-of-uniform safeguard, and prove it is a constant-factor approximation: 4/ln 2 ~= 5.77 under a mild granularity assumption and 6/ln 2 ~= 8.66 unconditionally. We implement the complete system in ns-3 -- a TWT wake/doze mechanism integrated with the power-save architecture, plus the scheduler -- and show that it is the only scheduler that stays near a relaxation lower bound across all regimes: against a strong energy-greedy baseline it ties when per-station energy floors already pin the periods, and wins by 4-36% exactly where the schedule density is binding and must be redistributed by AoI weight or channel quality rather than by energy budget -- the regime our analysis identifies.

cs.NI↗
arXiv2026

Measurement-Device Placement in MDI-QKD Networks with Minimal Trusted Relays

Measurement-Device-Independent Quantum Key Distribution (MDI-QKD) removes detector side-channel vulnerabilities by delegating measurements to an untrusted relay that, when shared by several user pairs, acts as a Bell-state measurement (BSM) hub. Channel loss still limits the reach of MDI-QKD links, so long-range services rely on trusted relays for key forwarding. As MDI-QKD moves toward metropolitan deployment, a key network-planning question arises: how should BSM hubs be placed on existing fiber infrastructure to minimize the use of trusted relays? In this work, we formalize this challenge as the MDI-QKD Hub Deployment (MHD) problem. We first prove that the MHD problem is NP-hard, and then formulate it as a Mixed-Integer Linear Programming (MILP). To the best of our knowledge, this is the first formulation for MDI-QKD network planning that captures the structural features specific to MDI-QKD, namely a shared BSM hub, two-link user-to-hub routing, and loss-balancing constraints, while jointly determining hub placement, user-to-hub assignment, and trusted-relay demand allocation. Our solution accounts for realistic budget and capacity constraints, including practical insights from real-world deployments of commercial MDI-QKD solutions. Numerical evaluations on three metropolitan topologies (12 to 50 nodes) at realistic geographic distances show that topology structure governs trusted-relay demand: hub placement alone eliminates all trusted relays in compact urban meshes, while in sparse topologies, relaxing the loss-balancing constraint removes the dominant source of trusted-relay usage at no additional infrastructure cost. The key-rate threshold at which trusted relays first appear shifts monotonically with the network diameter, i.e., the largest shortest-path distance between any node pair in fiber kilometers, delineating the feasibility boundary of pure MDI-QKD deployment.

cs.NI↗
arXiv2026

Message-Level Scheduling for RLNC-Coded Multi-Source Traffic

This paper studies weighted decoding-delay minimization for multiple RLNC-coded message streams that compete for finite processing capacity at a destination. Packet arrivals are exogenous, while the scheduler only determines the processing order of packets already available at the destination. A trace-conditioned offline scheduling formulation shows that a batch-release subclass is strongly NP-hard even with a single processing unit. Message-Aware Innovation-Deficit Scheduling (MAIDS) is then developed to prioritize each serviceable message according to its weight and remaining decoding deficit. For a single processing unit, MAIDS is shown to be exactly optimal under nonblocking progressive arrivals with equal weights and under common activation with arbitrary positive weights, while the unrestricted weighted online problem admits no universal deterministic $O(1)$ competitive ratio. Simulation results on streaming and batch benchmarks show that MAIDS consistently reduces weighted decoding delay relative to the tested baselines, remains close to the offline optimum on average, and recovers the predicted exact performance boundaries.

cs.NI↗