Skip to content
Open access

ConformalSafe-Routing: Uncertainty-Aware Safe Deep Reinforcement Learning for Adaptive Routing Convergence

Jul 2026 · Academic Journal of Applied Sciences · 0 citations · 30 references

TL;DR

The results support conformal shielding as a practical mechanism for exposing and controlling the safety-speed trade-off in learning-based routing, while also identifying the limits of guarantees under topology and load shift.

Abstract

Adaptive routing controllers based on deep reinforcement learning can shorten recovery after failures, but a policy optimized only for expected reward may select timer and damping configurations whose control overhead or route oscillation risk is poorly estimated under rare or shifted conditions. This paper presents ConformalSafe-Routing, a runtime safety layer for adaptive routing convergence. A dueling double deep Q-network ranks bounded routing profiles, while an independently trained risk model estimates one-step operational cost from topology, failure, load, and convergence-state features. Split conformal calibration converts point predictions into finite-sample upper bounds. A horizon-aware allocation uses a per-decision miscoverage budget of 0.0125 for an eight-step episode, and the shield selects the highest-value action whose upper bound satisfies the safety envelope; a balanced static profile is used when the certified set is empty. Experiments use four real telecom topologies from the Internet Topology Zoo and a fully released topology-driven event simulator. Across 300 paired episodes per condition, the proposed method reduces episode-level safety violations from 56.7% to 4.3% in-domain and from 64.0% to 2.0% under high-load distribution shift relative to unshielded DQN. It also reduces route flaps by 73.0% and 76.6%, respectively. Compared with a balanced static profile, it shortens mean convergence by 22.5% in-domain and 9.9% under shift while maintaining low violation rates. The results support conformal shielding as a practical mechanism for exposing and controlling the safety-speed trade-off in learning-based routing, while also identifying the limits of guarantees under topology and load shift.

Read PDF

Similar papers

Open access Jul 2026

MARL-Converge: Decentralized Multi-Agent Reinforcement Learning for Failure-Aware Routing Convergence

A reproducible discrete-time link-state convergence proxy with independent topology views, stochastic failure detection and link-state advertisement diffusion, shortest-path recomputation, and forwarding-loop/drop checks is implemented.

David Clarke, Mei Huang, Jonas Eriksen · 0 citations
#artificial intelligence Preprint Sep 2026

From Prior-Guided Heuristics to Deployable Agents: Accelerating Demonstration-Driven Reinforcement Learning for Deadline-Constrained Network Control

This paper introduces Effective Congestion (EC), a deadline-aware metric family that quantifies interface congestion by packet urgency and proactively filters non-viable traffic, coupled with a Uniform Path Grouping (UPG) distribution heuristic promoting robust load-balancing; the resulting policies are embedded into M...

V. N. Vitale, Mohammad Solki, A. Tulino et al. · 0 citations
Open access Jul 2026

GraphRoute-Transfer: Topology-Generalizable Routing Convergence Optimization via Graph Reinforcement Learning

GraphRoute-Transfer, a graph-neural-network policy that assigns per-node timers from local structural features and is by construction permutation- and size-invariant, is proposed, a graph-neural-network policy that assigns per-node timers from local structural features and is by construction permutation- and size-invar...

Yuto Nakamura · 0 citations

raphRoute -Transfer: Topology-eneralizable Routing Convergence Optimization via raph Reinforcement Learning

GraphRoute-Transfer, a graph-neural-network policy that assigns per-node timers from local structural features and is by construction permutation-and size-invariant, is proposed, a graph-neural-network policy that assigns per-node timers from local structural features and is by construction permutation-and size-invaria...

Yuto Nakamura · 0 citations
Open access Jul 2026

Robust Offline Multi-Agent Reinforcement Learning for Latency-Aware SDN Path Control in 6G-Oriented Network Softwarization

Future sixth-generation (6G)-oriented networks require programmable control that can adapt routing to latency and congestion without unsafe online exploration. This study evaluates offline multi-agent deep deterministic policy gradient (MADDPG) with behavior-adjusted training rewards for latency-aware path control in s...

A. Kyzyrkanov, Y. Nurakhov, Zhenis Otarbay et al. · 0 citations
Jul 2026

Learning to Optimize: Joint Routing and Flow Allocation on Sparse Non-Euclidean Networks

This work proposes Double-Channel Graph Attention (DCGA), an end-to-end reinforcement learning framework that isolates network reachability and demand-service logic into separate graph channels and constructs valid routes using a simulator-coupled, constraint-informed decoder.

Hao Sun, Fang He, Congyuan Ji et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.