Energy-Availability-Constrained Deep Reinforcement Learning for Blackout-Aware Task Offloading in Renewable-Powered SDN-MEC Networks
Abstract
Renewable-powered multi-access edge computing (MEC) exposes edge nodes to a failure mode absent from grid-powered systems: a node whose battery is depleted enters a service blackout. We study task offloading in a software-defined networking (SDN)-controlled MEC network with solar-powered, finite-battery servers, and enforce each node’s per-slot energy-availability constraint at the controller at two levels: a per-assignment screening test that prunes the action set of a deep reinforcement learning agent whose state carries battery state-of-charge and a harvest forecast, and a commit-time aggregate admission test that verifies the total energy committed to a node at the allocated frequencies. Policies are evaluated end-to-end, on the fraction of all generated tasks served within their deadline by a node that did not black out, over ten seeds with paired statistics. The aggregate admission test reduces the blackout rate to at most 0.4% of server-slots for every policy it wraps, learned or heuristic, while increasing delivered goodput (+19% for the learned agent, +9% for a delay-greedy heuristic). An ablation shows that the learned agent’s 88% blackout reduction relative to an energy-agnostic learner comes from the battery information in its state rather than from the screening test, and that fixed-penalty and Lagrangian soft-constraint baselines do not reach the same operating point. On end-to-end task success, a delay-greedy association under the same admission test delivers more than any learned policy at the reference operating point, and the learned policy overtakes it only under heavy load; we report this, together with the failure of preference conditioning to control the delay–energy trade-off, as limitations of learning in this setting rather than as properties of the admission mechanism.