Agentic Multi-Agent Reinforcement Learning for Adaptive and Quantum Aware Network Routing

Efficient and adaptive routing remains a critical challenge in dynamic network environments due to changing traffic conditions, network congestion, and link failures. Traditional routing approaches, such as Dijkstra and OSPF, rely on static or semi-adaptive mechanisms, which limit their ability to respond to real-time network variations. To address these limitations, this paper proposes an Agentic Multi-Agent Reinforcement Learning (AMARL) framework for intelligent and decentralized routing. In the proposed model, each network node operates as an autonomous agent capable of observing local network conditions, communicating with neighboring agents, and making cooperative routing decisions. A multi-objective reward function is designed to jointly optimize delay, throughput, packet delivery ratio, and packet loss. The framework enables dynamic adaptation to network changes without requiring global recomputation. Extensive simulations are conducted under varying network sizes, traffic conditions, and link failure scenarios. The results demonstrate that the proposed AMARL model achieves significant performance improvements, including up to 45% higher throughput, 35% lower delay, and over 50% reduction in packet loss compared to traditional methods. Furthermore, the model maintains higher reliability under link failures and exhibits fast convergence with reduced energy consumption over training episodes. These findings indicate that the integration of agentic intelligence and multi-agent cooperation provides a scalable, adaptive, and efficient solution for next-generation network routing. The proposed framework is particularly suitable for dynamic and large-scale network environments where traditional routing methods fail to perform effectively.

Authors

Institutions

Publication Details

Journal
The International journal of networked and distributed computing
Published
2026-11-14
DOI
https://doi.org/10.1007/s44227-026-00135-x
Primary Topic
Network Traffic and Congestion Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Agentic Multi-Agent Reinforcement Learning for Adaptive and Quantum Aware Network Routing

Nazmun Nessa Moon, Shaheena Sultana, Selina Sharmin, Fernaz Narin Nur et al.
The International journal of networked and distributed computing
Network Traffic and Congestion Control
article

Agentic Multi-Agent Reinforcement Learning for Adaptive and Quantum Aware Network Routing

Nazmun Nessa Moon, Shaheena Sultana, Selina Sharmin, Fernaz Narin Nur, Md. Hasanuzzaman Dipu, A. H. M. Saiful Islam
article en

Abstract

Efficient and adaptive routing remains a critical challenge in dynamic network environments due to changing traffic conditions, network congestion, and link failures. Traditional routing approaches, such as Dijkstra and OSPF, rely on static or semi-adaptive mechanisms, which limit their ability to respond to real-time network variations. To address these limitations, this paper proposes an Agentic Multi-Agent Reinforcement Learning (AMARL) framework for intelligent and decentralized routing. In the proposed model, each network node operates as an autonomous agent capable of observing local network conditions, communicating with neighboring agents, and making cooperative routing decisions. A multi-objective reward function is designed to jointly optimize delay, throughput, packet delivery ratio, and packet loss. The framework enables dynamic adaptation to network changes without requiring global recomputation. Extensive simulations are conducted under varying network sizes, traffic conditions, and link failure scenarios. The results demonstrate that the proposed AMARL model achieves significant performance improvements, including up to 45% higher throughput, 35% lower delay, and over 50% reduction in packet loss compared to traditional methods. Furthermore, the model maintains higher reliability under link failures and exhibits fast convergence with reduced energy consumption over training episodes. These findings indicate that the integration of agentic intelligence and multi-agent cooperation provides a scalable, adaptive, and efficient solution for next-generation network routing. The proposed framework is particularly suitable for dynamic and large-scale network environments where traditional routing methods fail to perform effectively.

The International journal of networked and distributed computing
University of Notre Dame (US), Daffodil International University (BD), Southeast University (BD), Jagannath University (BD)
Network Traffic and Congestion Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon