Maximizing Routing Efficiency in OSPF through Adaptive Link Weight Adjustment using Multi-Agent Reinforcement Learning
**Abstract:** This research proposes a novel approach to enhancing routing efficiency within Open Shortest Path First (OSPF) networks by employing a Multi-Agent Reinforcement Learning (MARL) framework for adaptive link weight adjustment. Existing OSPF implementations rely on static link metrics, failing to dynamically adapt to fluctuating network conditions. Our method utilizes a distributed network of agent nodes, each responsible for locally observing link quality and dynamically adjusting link weights to optimize overall network performance. This results in faster convergence times, reduced congestion, and improved resilience to network failures. The proposed system is immediately deployable leveraging existing OSPF infrastructure with minimal modifications and has the potential to significantly improve network performance in large-scale, dynamic environments, estimated to improve overall network throughput by 15-22% in simulated scenarios.
Institutions
- Freed–Hardeman University (US)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2025-08-10
- DOI
- https://doi.org/10.5281/zenodo.16787383
- Primary Topic
- Plant Reproductive Biology
- Type
- article
- Field-Weighted Citation Impact
- 0.00