GDPlan: Generative Network Planning via Graph Diffusion Model
IEEE Transactions on Networking · 2025-08 · 33 (4) · 1422-1437
DOI: 10.1109/ton.2025.3535518 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Networking, 2025-08. Verfasst von Nuowen Kan und 6 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 54 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Program of Shanghai Science and Technology Innovation Project.
Abstract (Originalsprache)
Network planning is crucial to facilitate network service under limited network operation costs. However, adapting the network topology (i.e., connections and capacities for physical and IP links) to time-varying and stochastic network states is challenging due to high computational overhead of problem solving. Existing deep learning based methods suffer from prohibitive computational complexity due to simultaneously solving IP link capacities and allocated traffics or iteratively exploring search space with excessive samples via heuristic rules. In this paper, we propose GDPlan, the first generative framework that leverages conditional graph diffusion model to address this challenge. To achieve high solving efficiency, GDPlan decouples network planning into two separate stages, i.e., generation of diverse high-quality solutions to IP link capacity and refinement of the solutions under feasibility constraints. Specifically, we develop generation-oriented graph signal modeling that reformulates solving IP link capacities as generation of graph topology conditioned on the graph signals related to traffic demands, physical links and network costs. Consequently, energy-guided controllable graph generation is achieved to capture significant structural patterns of graph topology with score-based graph diffusion model and produce diverse solutions with a guarantee of feasibility under specific objectives or constraints. GDPlan successfully achieves graph generation based solution to network planning with an order of magnitude higher solving speed than the commercial solver Gurobi. Experimental results demonstrate that, compared with Gurobi, the proposed GDPlan obtains lowest 3.7% average gap with only about 7.5% average running time.
Förderung
- National Natural Science Foundation of China
- Program of Shanghai Science and Technology Innovation Project
Zitieren
APA
Kan, N., Yan, S., Zou, J., Dai, W., Gao, X., Li, C., & Xiong, H. (2025). GDPlan: Generative Network Planning via Graph Diffusion Model. IEEE Transactions on Networking, 33(4), 1422-1437. https://doi.org/10.1109/ton.2025.3535518
Vancouver
Kan N, Yan S, Zou J, Dai W, Gao X, Li C, et al. GDPlan: Generative Network Planning via Graph Diffusion Model. IEEE Transactions on Networking. 2025;33(4):1422-1437. doi:10.1109/ton.2025.3535518
BibTeX
@article{Kan2025,
author = {Kan, Nuowen and Yan, Sa and Zou, Junni and Dai, Wenrui and Gao, Xing and Li, Chenglin and Xiong, Hongkai},
title = {GDPlan: Generative Network Planning via Graph Diffusion Model},
journal = {IEEE Transactions on Networking},
year = {2025},
volume = {33},
number = {4},
pages = {1422--1437},
doi = {10.1109/ton.2025.3535518}
}
EUVIMED