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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Maximizing Routing Efficiency in OSPF through Adaptive Link Weight Adjustment using Multi-Agent Reinforcement Learning

Zenodo (CERN European Organization for Nuclear Research)
Plant Reproductive Biology
article

Maximizing Routing Efficiency in OSPF through Adaptive Link Weight Adjustment using Multi-Agent Reinforcement Learning

article en

Abstract

**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.

Zenodo (CERN European Organization for Nuclear Research)
Freed–Hardeman University (US)
Industry, innovation and infrastructure
Openalex Percentile: Top 55%
Plant Reproductive Biology
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.

Maximizing Routing Efficiency in OSPF through Adaptive Link Weight Adjustment using Multi-Agent Reinforcement Learning · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS