Skip to content
Conference

Metadata Clustering-Driven Federated Learning for Multi-Domain Virtual Network Function Scaling

Jul 2026 · International Conference on Computer Communications and Networks · pp. 1-6 · 0 citations · 19 references

Abstract

In multi-domain networking, virtual network function (VNF) scaling using machine learning requires an accurate prediction model while addressing privacy constraints and non-identical and independently distributed (non-IID) data across domains. Current models have used conventional federated learning (FL) methods, such as federated averaging (FedAvg), yet they suffer from degraded performance due to heterogeneous traffic patterns in multi-domain networks. However, existing studies have not addressed the impact of non-IID characteristics on FL-based VNF scaling or developed an effective solution to mitigate it. This paper proposes a metadata-clustering-driven FL method that clusters domains with different traffic patterns and trains cluster-specific models. We extract statistical, spectral, and temporal features to represent traffic disturbance. We apply principal component analysis (PCA) followed by K-means clustering to group time series. We apply FedAvg within clusters to train cluster-specific prediction models. To evaluate the performance of the proposed method, we set up a testbench to synchronize three non-IID patterns. The numerical results demonstrate that the proposed clustered FL method consistently achieves a lower mean squared error (MSE) than the FedAvg baseline across all four evaluated non-IID settings. The proposed method yields an MSE of 0.7056 (a 23.1% reduction from FedAvg’s 0.9176) under label skew, 0.3615 (a 4.6% reduction from 0.3790) under label and feature skew, 0.6958 (a 28.1% reduction from 0.9682) under label and quantity skew, and 0.3748 (a 0.7% reduction from 0.3774) under the combined skew setting. These consistent reductions in MSE demonstrate that the proposed method effectively mitigates the performance degradation typically caused by non-IID effects.

View source

Similar papers

Aug 2026

Prototype-based federated learning for one-time soft clustering

Experiments under representative Non-IID settings on benchmark datasets show that PFLS-One achieves improved accuracy and faster convergence compared with representative baseline methods, and the convergence analysis under a non-convex objective provides theoretical support for the proposed method.

Ping Xie, Xiang-Rui Gao, Jingyan Wu et al. · 0 citations
Book Open access Aug 2026

SensCluster: Sensitivity-Guided Client Clustering for Feature-Skewed Federated Learning

SensCluster is proposed, a novel sensitivity-aware CFL framework that constructs compact client representations by selecting parameters that are most responsive to local feature distributions, and consistently outperforms state-of-the-art CFL methods across diverse feature skew scenarios.

Jiaqi Wang, Tobias Schlagenhauf, Setareh Maghsudi · 0 citations
#machine learning Preprint Sep 2026

HybridFLow: SDN-Orchestrated Client Partitioning for Hybrid Federated Learning

HybridFLow is presented, a closed-loop SDN-driven orchestration framework that integrates network-layer intelligence directly into hybrid FL and generates calibrated per-client communication-time estimates before each training round and uses them to partition clients into synchronous and asynchronous groups while balan...

Osama Abu Hamdan, Rabina Pandey, Hao Che et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.