{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,22]],"date-time":"2026-11-22T06:58:11Z","timestamp":1795330691256,"version":"4.10.3"},"reference-count":20,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the Science and Technology Project of State Grid Henan Electric Power Company","award":["No.521710250009"],"award-info":[{"award-number":["No.521710250009"]}]},{"name":"the Science and Technology Project of Henan Province","award":["No.252102211085"],"award-info":[{"award-number":["No.252102211085"]}]},{"name":"the Science and Technology Project of Henan Province","award":["No.252102211105"],"award-info":[{"award-number":["No.252102211105"]}]},{"name":"the Science and Technology Project of Henan Province","award":["No.252102211070"],"award-info":[{"award-number":["No.252102211070"]}]},{"name":"the Stabilization Support Program of The Shenzhen Science and Technology Innovation Commis-sion","award":["No.20231130110921001"],"award-info":[{"award-number":["No.20231130110921001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/fi17110484","type":"journal-article","created":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T05:20:44Z","timestamp":1761196844000},"page":"484","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SFC-GS: A Multi-Objective Optimization Service Function Chain Scheduling Algorithm Based on Matching Game"],"prefix":"10.3390","volume":"17","author":[{"given":"Shi","family":"Kuang","sequence":"first","affiliation":[{"name":"Transmission Operation and Inspection Center, State Grid Zhengzhou Electric Power Supply Company, Zhengzhou 450007, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshu","family":"Niu","sequence":"additional","affiliation":[{"name":"Transmission Operation and Inspection Center, State Grid Zhengzhou Electric Power Supply Company, Zhengzhou 450007, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sunan","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Electronics & Communication Engineering, Shenzhen Polytechnic University, Shenzhen 518005, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haoran","family":"Li","sequence":"additional","affiliation":[{"name":"College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450007, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siyuan","family":"Liang","sequence":"additional","affiliation":[{"name":"College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450007, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Software Engineering, Zhengzhou University of Light Industry, Zhengzhou 450007, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,10,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Kukkalli, H., Hajizadeh, M., and Bauschert, T. (2024, January 6\u201310). Practical Evaluation of Dynamic Service Function Chaining (SFC) for Softwarized Mobile Services in an SDN-based Cloud Network. Proceedings of the NOMS 2024-2024 IEEE Network Operations and Management Symposium, Seoul, Republic of Korea.","DOI":"10.1109\/NOMS59830.2024.10575344"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"19121","DOI":"10.1109\/JIOT.2024.3362991","article-title":"Fault diagnosis in the network function virtualization: A survey, taxonomy, and future directions","volume":"11","author":"Li","year":"2024","journal-title":"IEEE Internet Things J."},{"key":"ref_3","unstructured":"Ikhelef, I.A. (2024). Optimization of VNF Placement and Chaining According to NFV\/SDN Paradigms. [Ph.D. Thesis, Universit\u00e9 Paris-Nord-Paris XIII]."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3883","DOI":"10.1007\/s12083-024-01800-0","article-title":"End to end delay aware service function chain scheduling in network function virtualization enabled networks","volume":"17","author":"Dubba","year":"2024","journal-title":"Peer-Peer Netw. Appl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"11235","DOI":"10.1109\/TVT.2025.3543259","article-title":"Service Function Chain Dynamic Scheduling in Space-Air-Ground Integrated Networks","volume":"74","author":"Jia","year":"2025","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4598","DOI":"10.1109\/TNSM.2024.3424297","article-title":"Service Function Chain Scheduling Under the Multi-Cloud Collaborative Service of Information Networks Used for Cross-Domain Remote Surgery","volume":"21","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Song, Y., Peng, R., Feng, X., Zhang, K., Zhuang, L., and He, M. (2024, January 29\u201331). A Delay Optimization Service Function Chain Rescheduling Algorithm Based on Deep Reinforcement Learning. Proceedings of the 2024 5th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT), Nanjing, China.","DOI":"10.1109\/AINIT61980.2024.10581846"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Cao, Y., Jia, Z., Zhang, Y., Dong, C., Zhou, F., and Wu, Q. (2024, January 24\u201326). Task-Oriented Service Provision and Scheduling for Non-Terrestrial Networks: A Deep Reinforcement Learning Based Approach. Proceedings of the 2024 16th International Conference on Wireless Communications and Signal Processing (WCSP), Hefei, China.","DOI":"10.1109\/WCSP62071.2024.10826922"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10586-024-04751-6","article-title":"Optimizing service function chaining and scheduling with deep Q-learning for enhanced quality of experience in edge networks","volume":"28","author":"Baharvand","year":"2025","journal-title":"Clust. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Jia, J., Yang, L., and Cao, J. (2021, January 10\u201313). Reliability-aware dynamic service chain scheduling in 5G networks based on reinforcement learning. Proceedings of the IEEE INFOCOM 2021\u2014IEEE Conference on Computer Communications, Virtual.","DOI":"10.1109\/INFOCOM42981.2021.9488707"},{"key":"ref_11","first-page":"1","article-title":"A Deep Reinforcement Learning (DRL) Based Approach to SFC Request Scheduling in Computer Networks","volume":"15","author":"Nagireddy","year":"2024","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, H., Wei, X., Zhao, K., Fan, J., Chen, J., Hu, Y., and Jia, R. (2023). Service function chain scheduling in heterogeneous multi-UAV edge computing. Drones, 7.","DOI":"10.3390\/drones7020132"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Liao, C., Chen, J., Gao, D., Huang, X., Liu, J., Liu, S., and Qian, D. (2024, January 24\u201327). CVTSA: Cooperative VNF and Time-Slot Scheduling Algorithm for NFV Orchestration. Proceedings of the 2024 IEEE 99th Vehicular Technology Conference (VTC2024-Spring), Singapore.","DOI":"10.1109\/VTC2024-Spring62846.2024.10683557"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Aggarwal, V., and Lan, T. (2025). Network Diffuser for Placing-Scheduling Service Function Chains with Inverse Demonstration. arXiv.","DOI":"10.1109\/INFOCOM55648.2025.11044702"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/LCOMM.2017.2747509","article-title":"Virtual network function scheduling: A matching game approach","volume":"22","author":"Pham","year":"2017","journal-title":"IEEE Commun. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"30623","DOI":"10.1109\/ACCESS.2025.3540745","article-title":"Enhancing Security and Privacy in 5G Device-to-Device Communication: A Secure Gale-Shapley Algorithm Approach","volume":"13","author":"Alruwaili","year":"2025","journal-title":"IEEE Access"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Constantin, M.A., Schuurman, N.K., and Vermunt, J.K. (2023). A general Monte Carlo method for sample size analysis in the context of network models. Psychol. Methods.","DOI":"10.1037\/met0000555"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Lee, H., Lee, H., Jung, S., and Kim, J. (2022, January 12\u201315). Stable marriage matching for traffic-aware space-air-ground integrated networks: A gale-shapley algorithmic approach. Proceedings of the 2022 International Conference on Information Networking (ICOIN), Jeju Island, Republic of Korea.","DOI":"10.1109\/ICOIN53446.2022.9687261"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/TNSM.2021.3049298","article-title":"DDQP: A double deep Q-learning approach to online fault-tolerant SFC placement","volume":"18","author":"Wang","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Li, L., Sun, R., Zhao, S., and Wang, C. (2020, January 27\u201330). Research on SFC Fast Bullet State Detection Method Combining Statistics and Conditional Random Field. Proceedings of the 13th Asia Pacific Transportation Development Conference, Shanghai, China.","DOI":"10.1061\/9780784482902.046"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/11\/484\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T04:27:52Z","timestamp":1761280072000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/17\/11\/484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,22]]},"references-count":20,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["fi17110484"],"URL":"https:\/\/doi.org\/10.3390\/fi17110484","relation":{},"ISSN":["1999-5903"],"issn-type":[{"value":"1999-5903","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,22]]}}}