SFC-GS: A Multi-Objective Optimization Service Function Chain Scheduling Algorithm Based on Matching Game
Rattachement africain : cn. Niveau de preuve : code pays fourni par la source.
Le résumé fourni par la source
Service Function Chain (SFC) is a framework that dynamically orchestrates Virtual Network Functions (VNFs) and is essential to enhancing resource scheduling efficiency. However, traditional scheduling methods face several limitations, such as low matching efficiency, suboptimal resource utilization, and limited global coordination capabilities. To this end, we propose a multi-objective scheduling algorithm for SFCs based on matching games (SFC-GS). First, a multi-objective cooperative optimization model is established that aims to reduce scheduling time, increase request acceptance rate, lower latency, and minimize resource consumption. Second, a matching model is developed through the construction of preference lists for service nodes and VNFs, followed by multi-round iterative matching. In each round, only the resource status of the current and neighboring nodes is evaluated, thereby reducing computational complexity and improving response speed. Finally, a hierarchical batch processing strategy is introduced, in which service requests are scheduled in priority-based batches, and subsequent allocations are dynamically adjusted based on feedback from previous batches. This establishes a low-overhead iterative optimization mechanism to achieve global resource optimization. Experimental results demonstrate that, compared to baseline methods, SFC-GS improves request acceptance rate and resource utilization by approximately 8%, reduces latency and resource consumption by around 10%, and offers clear advantages in scheduling time.
Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.
Le contrôle bibliographique ouvert
DOI retrouvé dans Crossref DOI retrouvé ; titre concordant.
- Titre Crossref
- SFC-GS: A Multi-Objective Optimization Service Function Chain Scheduling Algorithm Based on Matching Game
- Date Crossref
- 22/10/2025
- Éditeur
- MDPI AG
- Type
- journal-article
Ce recoupement confirme des métadonnées liées au DOI. Il ne confirme ni la méthode ni les conclusions de l’étude, et il ne compte pas comme une seconde source scientifique indépendante.
Où se fait cette recherche
-
State Grid Corporation of China (China) pays non établi dans la noticeEntreprise
-
Inner Mongolia Electric Power (China) pays non établi dans la noticeEntreprise
-
Shenzhen Polytechnic University pays non établi dans la noticeUniversité ou école supérieure
-
Zhengzhou University of Light Industry pays non établi dans la noticeUniversité ou école supérieure
-
State Grid Zhengzhou Electric Power Supply Company Transmission Operation and Inspection Center pays non établi dans la noticeEntreprise
-
College of Electronics & Communication Engineering pays non établi dans la noticeUniversité ou école supérieure
-
College of Software Engineering pays non établi dans la noticeUniversité ou école supérieure
State Grid Corporation of China (China), Inner Mongolia Electric Power (China) et Shenzhen Polytechnic University, avec 4 autres affiliations.
Une affiliation ne permet pas de déduire la nationalité d’un auteur.