arXiv:2511.01343cs.LG2025-11

用扩散模型优化云原生网络功能部署,提升效率与可行性。

CNFP: Optimizing Cloud-Native Network Function Placement with Diffusion Models on the Cloud Continuum

  • 将网络功能部署建模为条件图到分配的生成任务,利用图神经网络去噪器迭代优化。
  • 在多种拓扑和约束条件下,推理速度远超传统求解器,且始终生成可行解。
  • 适合5G/6G网络中大规模、动态变化的云原生服务链部署场景。

在当前5G及未来6G网络的编排中,跨云连续体部署云原生网络功能(CNF)是核心挑战。该过程需在分布式云基础设施上实现依赖的计算任务,以服务功能链(SFC)形式组织,并满足严格的资源、带宽、连通性和端到端延迟约束。经典方法如混合整数规划、启发式算法和强化学习在可扩展性、约束处理鲁棒性及对未见网络条件的泛化能力方面存在实际局限。本文提出基于去噪扩散概率模型(Denoising Diffusion Probabilistic Models)的理论与算法框架,将部署过程重构为条件图到分配的生成任务。每个场景编码为异构图,捕获基础设施与服务链结构。训练图神经网络去噪器,迭代精炼含噪的CNF-云分配矩阵。通过在训练中引入约束感知惩罚项,引导生成过程趋向合法部署。推理阶段采样多个候选解,选取最优可行解。在多样化拓扑上的大量实验,包括超出分布的大规模实例与约束偏移场景,表明该方法始终生成可行解,且推理速度显著优于其他求解器。结果验证了扩散生成模型在云连续体编排中约束性网络部署与嵌入任务中的可扩展潜力。

原文摘要 · Abstract (English)

The placement of Cloud-Native Network Functions across the Cloud-Continuum represents a core challenge in the orchestration of current 5G and future 6G networks. The process entails the implementation of interdependent computing tasks, which are structured as Service Function Chains, over distributed cloud infrastructures. This is achieved while satisfying strict resource, bandwidth, connectivity, and end-to-end latency constraints. It is widely acknowledged that classical approaches, including mixed-integer (non)linear programming, heuristics, and reinforcement learning, face practical limitations in terms of scalability, robust constraint handling, and generalization to unseen network conditions. In this study, a diffusion-based theoretical and algorithmic framework for CNF placement is proposed, based on Denoising Diffusion Probabilistic Models. The placement process is reconceptualised as a conditional graph-to-assignment generation task. Each scenario is encoded as a heterogeneous graph, capturing infrastructure and service-chain structure. A Graph Neural Network denoiser is trained to iteratively refine noisy CNF-to-cloud assignment matrices. In order to bias the generation process towards valid deployments, the model incorporates constraint-aware penalties during training. At inference, a multitude of candidate placements are sampled, and the best suboptimal, feasible solution is selected. Extensive experimentation on diverse topologies, incorporating out-of-distribution evaluations with larger instances and shifted constraint regimes, demonstrates that the proposed approach consistently generates feasible solutions with considerably accelerated inference compared to other solvers. The findings of this study demonstrate the potential of diffusion-based generative modelling as a scalable tool for constrained network placement and embedding in cloud-continuum orchestration.

网络部署扩散模型5G/6G图神经网络

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。