[1]黄 骅,江 俊,杨永康,等.一种收益最大化的服务功能链优化编排算法[J].郑州大学学报(工学版),2022,43(6):22-29.
 HUANG H,JIANG J,YANG Y k,et al.A Profit MaximizationVirtual Network Function Placement Algorithm[J].Journal of Zhengzhou University (Engineering Science),2022,43(6):22-29.
点击复制

一种收益最大化的服务功能链优化编排算法()
分享到:

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
43
期数:
2022年6期
页码:
22-29
栏目:
出版日期:
2022-09-02

文章信息/Info

Title:
A Profit MaximizationVirtual Network Function Placement Algorithm
作者:
黄 骅 江 俊杨永康 何德峰 曹 斌
Author(s):
HUANG H JIANG J YANG Y ket al
文献标志码:
A
摘要:
针对数据中心内的服务功能链优化编排的问题,通过分析请求到达率、计算资源与处理延时之 间的关系,以最大化部署收益为优化目标,构建了一种基于弹性资源分配的服务功能链优化编排模型, 在此基础上提出一种收益最大化的服务功能链编排算法。 该算法分为 2 个阶段, 第 1 阶段,在满足处理时长的前提下优化服务功能链的资源消耗,在满足传输时延约束的前提下提高资源使用率,降低资源开 销。 第 2 阶段 ,面向虚拟网络功能部署及映射链路, 基于 worst-fit 策 略,交替采用自上而下和自下而上 2种搜索策略, 以提升部署效率,最大化计算资源和链路资源利用率。 针对 pod 数为 4 和 6 两种场景,设计了仿真实验以验证启发式算法的性能。 实验结果表明:相比现有算法,本文算法在部署收益、部署成功率和资源利用率3个指标方面均有一定提升,能够实现服务资源的优化配置, 有效提升部署收益。
Abstract:
In this study, the service function chain (SFC) orchestration problem in data centers was investiga- ted. The relationship between request arrival rate, computing resources and processing delay were analized. A flexible resource allocation optimization model aiming at maximize deployment benefits was proposed. Moreo- ver, a heuristic method is developed to solve the problem in two stages. Firstly, the resource usage for SFC was optimized based on flexible resource allocation considering service delay. Secondly, for the virtual network function deployment and link mapping, the top-down and bottom-up search strategies based on worst-fit strate- gy were alternately adopted to improve the deployment efficiency and reduce the SFC delay. Finally, simula- tion with 4 and 6 pods in data center was designed to verify the performance of our heuristic algorithm. Experi- mental results demonstrated that, compared with existing methods, the development profit, success rate and resource utilization were improved in our algorithm.
更新日期/Last Update: 2022-10-03