GPG-VNFE: Towards Foundation Models via Graph Pretraining for Generalizable VNF Embedding

The placement of Virtual Network Functions (VNFs) plays a critical role in the provisioning of services across nextgeneration networks. However, the constantly changing conditions in network topologies, traffic demands and resource availability pose significant challenges to achieving efficient and reliable placement strategies. While Deep Reinforcement Learning (DRL) has been widely explored to address this problem, these approaches have limited generalization capabilities and require retraining when faced with unfamiliar scenarios, such as network topology changes, failure events or evolving service requests (e.g., VNF Forwarding Graphs or VNF-FGs). To address these limitations, we propose GPG-VNFE, a foundation Graph Neural Network (GNN) architecture that integrates graph contrastive learning with generative models as Learnable Priors (GraphCL-LP) within a Transformer-based DRL framework. GPG-VNFE first pretrains two domain-specific GNN encoders using GraphCL-LP, one for substrate network topologies and another for VNF-FG service graphs. Through extensive simulation on a medium-size network topology, we show that GPG-VNFE improves the acceptance ratio of incoming VNF requests by up to 57.45% compared with three baseline state-of-the-art placement approaches. We also show that our proposal lowers the power consumption at the physical layer by up to 11%, outperforming two of the baseline approaches.

Authors

Institutions

Publication Details

Published
2025-10-27
DOI
https://doi.org/10.23919/cnsm67658.2025.11297510
Primary Topic
Software-Defined Networks and 5G
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GPG-VNFE: Towards Foundation Models via Graph Pretraining for Generalizable VNF Embedding

Omar Houidi, Djamal Zeghlache, Oussama Soualah, Nour-El-Houda Yellas
Software-Defined Networks and 5G
article

GPG-VNFE: Towards Foundation Models via Graph Pretraining for Generalizable VNF Embedding

Omar Houidi, Djamal Zeghlache, Oussama Soualah, Nour-El-Houda Yellas
article en

Abstract

The placement of Virtual Network Functions (VNFs) plays a critical role in the provisioning of services across nextgeneration networks. However, the constantly changing conditions in network topologies, traffic demands and resource availability pose significant challenges to achieving efficient and reliable placement strategies. While Deep Reinforcement Learning (DRL) has been widely explored to address this problem, these approaches have limited generalization capabilities and require retraining when faced with unfamiliar scenarios, such as network topology changes, failure events or evolving service requests (e.g., VNF Forwarding Graphs or VNF-FGs). To address these limitations, we propose GPG-VNFE, a foundation Graph Neural Network (GNN) architecture that integrates graph contrastive learning with generative models as Learnable Priors (GraphCL-LP) within a Transformer-based DRL framework. GPG-VNFE first pretrains two domain-specific GNN encoders using GraphCL-LP, one for substrate network topologies and another for VNF-FG service graphs. Through extensive simulation on a medium-size network topology, we show that GPG-VNFE improves the acceptance ratio of incoming VNF requests by up to 57.45% compared with three baseline state-of-the-art placement approaches. We also show that our proposal lowers the power consumption at the physical layer by up to 11%, outperforming two of the baseline approaches.

Direction des Services de la Navigation Aérienne (FR)
Decent work and economic growth
Openalex Percentile: Top 35%
Software-Defined Networks and 5G
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.