New Approaches for Network Topology Optimization Using Deep Reinforcement Learning and Graph Neural Network

The exponential growth in Internet-connected devices has escalated the demand for optimized network topologies to ensure high performance. Traditional optimization methods often fall short in scalability and adaptability when it comes to network topology planning. In this paper, we address the challenge of transforming mesh topologies into tree topologies for wireless networks, with the objective of maximizing throughput. We propose two new methods: Path Selection with Rejection Strategy (PSRS), which leverages Message-Passing Neural Networks (MPNN), and Dual-Agent Tree Topology Exploration (DATTE), which employs Graph Attention Networks (GAT). These schemes integrate Deep Reinforcement Learning (DRL) and Graph Neural Networks (GNNs) to construct efficient tree topologies with the goal of maximizing the minimum throughput of the wireless network. Experimental results validate the scalability and performance gains of the proposed approaches, highlighting their potential for real-world applications.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3569236
Citations
4
Primary Topic
Advanced Computing and Algorithms
Type
article
Field-Weighted Citation Impact
24.71

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

New Approaches for Network Topology Optimization Using Deep Reinforcement Learning and Graph Neural Network

Mohammed Hasan Ali, Ghassan Dahman, François Gagnon, François Duchesne et al.
4 citations
IEEE Access
Advanced Computing and Algorithms
24.71
article

New Approaches for Network Topology Optimization Using Deep Reinforcement Learning and Graph Neural Network

Mohammed Hasan Ali, Ghassan Dahman, François Gagnon, François Duchesne, Diala Naboulsi
article en
4 citations

Abstract

The exponential growth in Internet-connected devices has escalated the demand for optimized network topologies to ensure high performance. Traditional optimization methods often fall short in scalability and adaptability when it comes to network topology planning. In this paper, we address the challenge of transforming mesh topologies into tree topologies for wireless networks, with the objective of maximizing throughput. We propose two new methods: Path Selection with Rejection Strategy (PSRS), which leverages Message-Passing Neural Networks (MPNN), and Dual-Agent Tree Topology Exploration (DATTE), which employs Graph Attention Networks (GAT). These schemes integrate Deep Reinforcement Learning (DRL) and Graph Neural Networks (GNNs) to construct efficient tree topologies with the goal of maximizing the minimum throughput of the wireless network. Experimental results validate the scalability and performance gains of the proposed approaches, highlighting their potential for real-world applications.

IEEE AccessVol. 13
École de Technologie Supérieure (CA)
Mitacs
Openalex Percentile: Top 1%
Advanced Computing and Algorithms
24.71
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.