MétaCan
Menu
Back to cohort

MAGHE: A Predictive Mobility-Aware Framework for VNF Embedding in B5G Networks

2025· article· W7125815852 on OpenAlexaff
Lara Tarkh, Mohan Li, Iqra Batool, Mostafa M. Fouda, Mohamed I. Ibrahem, Hanan Lutfiyya, Zubair Md Fadlullah

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsWestern University
Fundersnot available
KeywordsEmbeddingVirtual networkGreedy algorithmGeospatial analysisCluster analysisHeuristicMobile edge computingEnhanced Data Rates for GSM Evolution

Abstract

fetched live from OpenAlex

In Beyond Fifth Generation (B5G) networks, support for low-latency, high-mobility services such as augmented reality and autonomous systems demands efficient and predictive placement of Virtual Network Functions (VNFs). Traditional embedding algorithms like the Greedy Based Algorithm (GBA) and the Greedy Cost-Based Algorithm (GCBA) are inherently reactive, relying on current user positions and failing to adapt to user mobility patterns. We introduce MAGHE, a Mobility-Aware Greedy Heuristic Embedding framework that augments these baseline algorithms through predictive intelligence. MAGHE integrates machine learning-based trajectory forecasting using XGBoost and geospatial clustering to proactively embed VNFs near users’ anticipated locations. This design enables latencyaware, proactive placement across mobile edge infrastructure, an essential capability for B5G service continuity. Evaluations using real-world urban mobility traces demonstrate that MAGHE reduces average user-to-VNF latency by 3.6% compared to reactive baselines, while maintaining a 100% embedding success rate. These results showcase MAGHE’s potential as a lightweight, practical solution for mobility-aware VNF management in future B5G networks.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.302
Teacher spread0.288 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicSoftware-Defined Networks and 5GFrench-language works237,207