Service function chain mapping method based on delay guarantee
محفوظ في:
| الحاوية / القاعدة: | Cluster Computing vol. 28, no. 5 (Oct 2025), p. 322 |
|---|---|
| منشور في: |
Springer Nature B.V.
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | Citation/Abstract |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| مستخلص: | Network function virtualization achieves the softwareization of network functions through virtualization technology, reducing operational costs but introducing challenges in network orchestration complexity. To deploy service function chains efficiently and cost-effectively in a network function virtualization environment, a latency-guaranteed, optimized mapping method is proposed. Firstly, a model that minimizes the total network deployment cost for service function chains is established, comprehensively considering user latency requirements and network resource constraints. Secondly, a service function chain mapping method based on an improved sparrow search algorithm is introduced. Finally, the simulation results show that the bandwidth resource utilization of the ISSA-SFCM algorithm is improved by 3.8% and 8.5%, respectively, compared to the control DP-COA algorithm and First-Fit algorithm, with a higher service function chain request acceptance rate and lower average network cost. |
|---|---|
| تدمد: | 1386-7857 1573-7543 |
| DOI: | 10.1007/s10586-024-04967-6 |
| المصدر: | Advanced Technologies & Aerospace Database |