Agentic AI enabled network twins check dependencies to avoid errors
Can Agentic AI Undermine Its Own Assurance Loop? Closed-Loop Dependency Assurance for Cognitive Network Digital Twins
Artificial IntelligenceEmerging TechnologiesNetworking and Internet Architecture
Summary
Sometimes when a smart AI changes a computer network, it can accidentally mess up the ways we check if those changes worked. For example, a service might be rerouted but the monitoring data still comes from the old path, giving wrong results. The authors propose a way to make sure these changes don’t break the tools that keep an eye on the network. Their method uses a special graph to connect service needs with network monitoring and recovery tools, ensuring every step is checked before moving on. This helps AI plans avoid causing issues while managing networks.
What this means in practice
- •For network operations teams: Ensure network changes do not disrupt monitoring or recovery tools by verifying dependencies before applying AI-generated plans.
- •For cloud infrastructure managers: Maintain service quality when rerouting traffic by using dependency-aware validation that preserves accurate monitoring paths.
Authors
Ahmed Hussain, Konstantinos Kalogiannis, Salahuddin Salahuddin, Hexu Li, Thiemo Voigt
Abstract
Agentic Artificial Intelligence (AI) and Network Digital Twins (NDTs) are increasingly combined to form Cognitive Digital Twins (CDTs) that translate operational intents into network changes and support closed-loop management. However, a network change may achieve its intended objective while disrupting the monitoring or recovery mechanisms needed for subsequent decisions. For example, a service may be rerouted while its latency-monitoring traffic continues along the original path, producing measurements that no longer reflect the service's performance. We propose Closed-Loop Dependency Assurance (CLDA), an assurance mechanism that augments agentic AI-enabled NDTs with dependency-aware validation. In our framework, an agentic AI planner generates and refines network plans, while the NDT evaluates the projected network outcomes of these plans. CLDA extends this analysis using a Loop Dependency Graph (LDG) that connects service requirements to monitoring mechanisms, forwarding paths, failure domains, and recovery prerequisites. CLDA projects candidate actions onto these dependencies, checks intermediate states of multistep plans, and supports deterministic make-before-break repairs using temporary monitoring mechanisms. Unlike the Large Language Model (LLM)-based planner, CLDA uses explicit, deterministic rules for assurance decisions and repair. We evaluate CLDA through controlled reconfigurations, a 240-trial LLM-based planning campaign, and live network execution. A separate synthetic study examines deterministic assurance scalability across network models representing up to 1,024 routers.