Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.23763

AgenticNet: Utilizing AI Coding Agents To Create Hybrid Network Experiments

Majd Latah·Kubra Kalkan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Traditional network experiments focus on validation through either simulation or emulation. Each approach has its own advantages and limitations. In this work, we present a new tool for next-generation network experiments created through Artificial Intelligence (AI) coding agents. This tool facilitates hybrid network experimentation through simulation and emulation capabilities. The tool supports three main operation modes: pure simulation, pure emulation, and hybrid mode. AgenticNet provides a more flexible approach to creating experiments for cases that may require a combination of simulation and emulation. In addition, AgenticNet supports rapid development through AI agents. We experimentally evaluate the tool and present an approach to verify the generated code.

Explore related subjects

cs.NI

Keep this discovery

BibTeXRIS

Majd Latah, Kubra Kalkan. 2026-08-30. AgenticNet: Utilizing AI Coding Agents To Create Hybrid Network Experiments. https://arxiv.org/abs/2603.23763

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

Discover connections

cs.NI subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

arXiv2026

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI↗
arXiv2026

Network Topologies for QKD Networks

Quantum key distribution (QKD) is a method for distributing cryptographic keys between remote endpoints, enjoying security based on quantum physics. This paper makes a first step towards studying topologies for QKD networks. QKD networks imply several required characteristics for their reliability and efficiency. We express such properties in terms of graph structure. For the comparison of potential graphs, we describe cost functions that allow us to identify families of graphs that are reliable and efficient. To make the discussion realistic, we summarize representative field-reported QKD performance numbers and illustrate the sensitivity of secret-key rate (SKR) to a few dB of additional loss. Last, we present methods to construct large efficient graphs through connecting smaller graphs.

cs.NI↗