Service Function Chain Deployment Method for Delay and Reliability Optimization
-
摘要: 针对5G网络高可靠性、低时延的服务需求，该文提出一种面向时延与可靠性优化的服务功能链(SFC)部署(DROSD)方法。在不预留冗余资源的情况下，首先通过功能互斥约束来确定SFC中相邻虚拟网络功能(VNF)是否可聚合；其次通过功能性约束、资源约束选择可聚合物理节点集合，实现负载均衡，提高SFC可靠性；然后通过跳数约束进行优化，进一步筛选可聚合物理节点集合以降低SFC的端到端时延；最后通过节点可用资源、节点度以及与原节点跳数指标进行降序排列，取最大值物理节点部署VNF。SFC的路由选择，采用K-最短路径算法。仿真实验表明，该文所提算法提高了请求接受率、长期平均收益开销比，增强了SFC可靠性，降低了端到端时延，减小了平均带宽开销。Abstract: For the high reliability and low delay service requirements of 5G network, a Delay and Reliability Optimization of Service Function Chain (SFC) Deployment (DROSD) method is proposed. Without reservation of redundant resources, firstly, the function mutually exclusive constraints are used to determine whether the adjacent Virtual Network Function (VNF) in SFC can be combined; Secondly, functional constraints and resource constraints are used to select combinatorial physical node set to achieve load balancing and improve the reliability of SFC; Thirdly, the end-to-end delay of SFC is reduced by hop number constraints, and finally the VNF is deployed by the physical node with the maximum value, which is arranged in descending order through the available resources, node degree and hops from the original node. The routing of SFC adopts K-shortest path algorithm. The simulation results show that the proposed algorithm improves the request acceptance rate and the long-term average ratio of revenue to cost, enhances the reliability of SFC, reduces the end-to-end delay, and reduces the average bandwidth cost.
-
表 1 算法1：DROSD算法VNF部署流程
输入：${G^{\rm{s}}}$, $G_{\rm{v}}^g$ 输出：VNF_Embedding_List 对于$G_{\rm{v}}^g$中的${\rm{SF}}{{\rm{C}}_g}$， (1) 获取${\rm{SF}}{{\rm{C}}_g}$的VNF数目K for k=1:K-1 利用深度优先，对可靠性进行优化，判断相邻VNF是否满
足功能互斥约束if $P_{k,k + 1}^g = 0$ 对时延进行优化，利用算法2选取可部署物理节点集合
${M_1}$, ${M_2}$(2) if ${M_1}{\rm{ = } }\varnothing$ 部署失败 else if ${M_2}{\rm{ = } }\varnothing$ 部署失败 else 计算节点$Im$值，取最大值节点部署${f_k}$ end end else 对可靠性和时延进行优化，利用算法3选取可聚合物理节点集合$M_1'$, $M_2'$ if $M_1'{\rm{ = } }\varnothing$ 聚合失败 返回步骤(2) else if $M_2'{\rm{ = } }\varnothing$ 聚合失败 返回步骤(2) else 计算节点$Im$值，取最大值节点部署${f_k}$, ${f_{k{\rm{ + }}1}}$ end end end 
下载: 导出CSV
表 2 算法2：可部署物理节点选取流程
任意 ${f_k}$, ${w_i}$ for 未部署${\rm{SF}}{{\rm{C}}_g}$中VNF的所有物理节点$N_1^{\rm{s}}$ 选择满足功能性约束的物理节点 if $F_n^{{f_k},{w_i}}{\rm{ = }}1$ 选择满足资源约束的物理节点，实现负载均衡。 if $C_{n,{\rm{ava} } }^{\rm{s}} \ge C_{g,k}^{\rm{v}}{\rm{\& \& } }F_{n,{\rm{ava} } }^s \ge F_{g,k}^{\rm{v}}{\rm{\& \& } }{h_{ {S_1},n} } \le {h_0}$ $n \in {M_1}$ 利用与目的节点的跳数约束进一步优化时延 if ${h_{ {S_1},{D_g} } } \ge {h_{n,{D_g} } }$ $n \in {M_2}$ end end end end
下载: 导出CSV
表 3 算法3：可聚合物理节点选取流程
任意${f_k}$, ${w_i}$和${f_{k{\rm{ + }}1}},{w_j}$ for 未部署${\rm{SF}}{{\rm{C}}_g}$中VNF的所有物理节点$N_1^{\rm{s}}$ 对可靠性进行优化，选择满足${f_k}$，${f_{k{\rm{ + }}1}}$功能性约束的物理节点 if $F_n^{{f_k},{w_i}}{\rm{ = }}1{\rm{\& \& }}F_n^{{f_{k{\rm{ + }}1}},{w_j}}{\rm{ = }}1$ 选择满足资源约束的物理节点，实现负载均衡。 if $C_{n,{\rm{ava} } }^{\rm{s} } \ge (C_{g,k}^{\rm{v} } \!+\! C_{g,k{\rm{ + } }1}^{\rm{v} }){\rm{\& \& } }F_{n,{\rm{ava} } }^{\rm{s} } \ge (F_{g,k}^{\rm{v}} \!+\! F_{g,k + 1}^{\rm{v} }){\rm{\& \& } }$
$ {h_{ {S_1},n} } \le {h_1} $$n \in M_1'$ 利用与目的节点的跳数约束进一步优化时延 if ${h_{ {S_1},D} } \ge {h_{n,D} }$ $n \in M_2'$ end end end end
下载: 导出CSV
-
QI Dandan, SHEN Subin, WANG Guanghui, et al. Towards an efficient VNF placement in network function virtualization[J]. Computer Communications, 2019, 138: 81–89. doi: 10.1016/j.comcom.2019.03.005 YI Bo, WANG Xingwei, LI Keqin, et al. A comprehensive survey of network function virtualization[J]. Computer Networks, 2018, 133: 212–262. doi: 10.1016/j.comnet.2018.01.021 MIAO Wang, MIN Geyong, WU Yulei, et al. Stochastic performance analysis of network function virtualization in future internet[J]. IEEE Journal on Selected Areas in Communications, 2019, 37(3): 613–626. doi: 10.1109/JSAC.2019.2894304 SUN Gang, LIAO Dan, ZHAO Dongcheng, et al. Towards provisioning hybrid virtual networks in federated cloud data centers[J]. Future Generation Computer Systems, 2018, 87: 457–469. doi: 10.1016/j.future.2017.09.065 汤红波, 邱航, 游伟, 等. 基于联合备份的服务功能链可靠性保障的部署方法[J]. 电子与信息学报, 2019, 41(12): 3006–3013. doi: 10.11999/JEIT190013TANG Hongbo, QIU Hang, YOU Wei, et al. A reliability-guarantee method for service function chain deployment based on joint backup[J]. Journal of Electronics &Information Technology, 2019, 41(12): 3006–3013. doi: 10.11999/JEIT190013 SUN Gang, CHEN Zhenrong, YU Hongfang, et al. Online parallelized service function chain orchestration in data center networks[J]. IEEE Access, 2019, 7: 100147–100161. doi: 10.1109/ACCESS.2019.2930295 唐伦, 杨恒, 马润琳, 等. 基于5G接入网络的多优先级虚拟网络功能迁移开销与网络能耗联合优化算法[J]. 电子与信息学报, 2019, 41(9): 2079–2086. doi: 10.11999/JEIT180906TANG Lun, YANG Heng, MA Runlin, et al. Multi-priority based joint optimization algorithm of virtual network function migration cost and network energy consumption[J]. Journal of Electronics &Information Technology, 2019, 41(9): 2079–2086. doi: 10.11999/JEIT180906 CHENG Xiangle, WU Yulei, Min Geyong, et al. Network function virtualization in dynamic networks: A stochastic perspective[J]. IEEE Journal on Selected Areas in Communications, 2018, 36(10): 2218–2232. doi: 10.1109/JSAC.2018.2869958 ERAMO V, MIUCCI E, AMMAR M, et al. An approach for service function chain routing and virtual function network instance migration in network function virtualization architectures[J]. IEEE/ACM Transactions on Networking, 2017, 25(4): 2008–2025. doi: 10.1109/TNET.2017.2668470 RAAYATPANAH M A and WEISE T. Virtual network function placement for service function chaining with minimum energy consumption[C]. 2018 IEEE International Conference on Computer and Communication Engineering Technology (CCET), Beijing, China, 2018: 198–202. 唐伦, 赵培培, 赵国繁, 等. 基于QoS保障的服务功能链动态部署算法[J]. 北京邮电大学学报, 2018, 41(6): 90–96. doi: 10.13190/j.jbupt.2018-013TANG Lun, ZHAO Peipei, ZHAO Guofan, et al. Dynamic deployment algorithm for service function chaining with QoS guarantee[J]. Journal of Beijing University of Posts and Telecommunications, 2018, 41(6): 90–96. doi: 10.13190/j.jbupt.2018-013 HERKER S, AN Xueli, KIESS W, et al. Data-center architecture impacts on virtualized network functions service chain embedding with high availability requirements[C]. 2015 IEEE Globecom Workshops (GC Wkshps), San Diego, USA, 2015: 1–7. QU Long, KHABBAZ M, and ASSI C. Reliability-aware service chaining in carrier-grade softwarized networks[J]. IEEE Journal on Selected Areas in Communications, 2018, 36(3): 558–573. doi: 10.1109/JSAC.2018.2815338 TANG Lun, ZHAO Guofan, WANG Chenmeng, et al. Queue-aware reliable embedding algorithm for 5G network slicing[J]. Computer Networks, 2018, 146: 138–150. doi: 10.1016/j.comnet.2018.09.014 ZHAO Dongcheng, REN Jing, LIN Rongping, et al. On orchestrating service function Chains in 5G mobile network[J]. IEEE Access, 2019, 7: 39402–39416. doi: 10.1109/ACCESS.2019.2895316 -
图(7) / 表(4)
计量
- 文章访问数: 1312
- HTML全文浏览量: 733
- PDF下载量: 76
- 被引次数: 0
下载:
