2026· International Journal of Advanced Computer Science and Applications· Vol 17· 0 citations· 19 references
TL;DR
An in-depth comparison study is carried out on three population-based optimization algorithms for solving the placement problem of SFCs using Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Grey Wolf Optimization (GWO) on three cases, with PSO emerging as the most consistently high-performing algorithm across all three scenarios.
Abstract
There is an explosion in IoT devices, 5G technology, and MECs, that results in increasing demands on effective and scalable network services management. Service function chaining, defined as the sequence of functions in VNFs on a path, is one of the core principles behind the NFV architecture design. SFC allocation to the heterogeneous clouds–fogs–edges network is an NP-hard problem characterized by mutually conflicting goals, such as latency minimization, energy and cost reduction, and resource maximization. In this study, an in-depth comparison study is carried out on three population-based optimization algorithms for solving the placement problem of SFCs using Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Grey Wolf Optimization (GWO) on three cases: (1) VNF deployment cost/QoE optimization in a 5G hybrid cloud with 12 nodes and weighting factor γ=0.4; (2) SFC graph matching on MEC-NFV networks with a 100-node physical network, 20 VNFs, and equal utilization weights α=β=γ=1/3; and (3) multi-instance SFC mapping on Fog-to-Cloud (F2C) IoT environment with a 5-VNF chain across 5 nodes. These three algorithms have been evaluated under identical conditions: 10 independent runs, 200 iterations, 20–30 agents. Results demonstrate that GWO achieves the best VNF deployment objective (W =73.92, a 15.1% improvement over the BGWO baseline), PSO achieves the highest resource utilization (52.9%) in MEC-NFV placement, and both PSO and GWO reduce F2C end-to-end latency by 25% compared to the ILP reference (12 vs. 16 units at three instances), while all three algorithms reduce latency by approximately 80% relative to cloud-only deployment. PSO emerges as the most consistently high-performing algorithm across all three scenarios.
A constrained optimization model that supports different management goals through alternative objective functions (latency-aware or power-aware) while enforcing operational constraints, including node capacities, slice-specific latency bounds, and explicit limits on VNF migrations/relocations between scheduling periods is proposed.
R. Moreno-Vozmediano, E. Huedo, R. Montero et al.· Journal of Network and Syste...· 0 citations
The proposed RSO–SFO framework integrates both strategies within a unified fitness function designed to minimize deployment cost while ensuring efficient allocation of fog resources, confirming the effectiveness and robustness of the proposed hybrid strategy for optimal service placement in fog-based IoT environments.
H. Merouani, S. Bendib, H. Moumen et al.· Revista Internacional de Mét...· 0 citations
This paper proposes a QoS-aware and energy-efficient metaheuristic optimization-based service placement strategy for an integrated IoT and fog computing environment to improve QoS and demonstrates that the developed hybrid algorithm reduces energy consumption by 3.09% and minimize network usage significantly compared with baselines.
Pallavi Mettupalli Venkata, Thatikonda Supraja, Priyanka Chawla et al.· Journal of Supercomputing· 0 citations
These findings demonstrate that DI-MNA provides an effective balance between solution quality, scalability, and computational efficiency for resource allocation in large-scale IoT networks.
This work aims to design an efficient framework by incorporating a novel hybrid metaheuristic algorithm that combines Draco Lizard Optimization (DLO) and Sand Cat Optimization (SCO) for optimal task offloading and resource allocation for IoT applications.
The Internet of Things (IoT) has grown rapidly in recent years, enabling the interconnection of a large number of heterogeneous and distributed devices. This number is expected to exceed 70 billion according to Statista. With this massive scale, fulfilling complex IoT applications that require combinations of multiple objects remains a real challenge. Moreover, several Quality of Service (QoS) requirements must be satisfied, making the problem of selecting appropriate IoT services NP-hard. In such environments, task offloading is a key mechanism to efficiently distribute computational workloads across edge, fog, and cloud resources. However, selecting the optimal offloading decision remains a difficult NP-hard problem due to system heterogeneity and conflicting objectives. In this paper, we propose a GNN-DQN-based approach for task offloading in edge–fog–cloud environments. Unlike prior GNN-DQN approaches limited to single- or dual-tier architectures, our framework explicitly models heterogeneous node types and inter-tier communication links, enabling more balanced and scalable resource allocation. Experimental results show that GNN-DQN achieves a mean latency of 2.64 s, representing improvements of 70.2% over Random, 7.8% over DQN-only, and 3.5% over Greedy. A GNN-A2C baseline is also included to broaden the comparison with a modern DRL method. Despite sharing the same GNN encoder, it underperforms GNN-DQN across all metrics, confirming the superiority of the DQN learning backbone. These results highlight the effectiveness of integrating graph-based representation with reinforcement learning, while also revealing a trade-off between latency optimization and energy efficiency.
Sirine Hakim, Sonia Yassa· International Conference on...· 0 citations