计算机工程 ›› 2020, Vol. 46 ›› Issue (4): 183-188,197.doi: 10.19678/j.issn.1000-3428.0055050

• 移动互联与通信技术 • 上一篇    下一篇

基于VNF组合的服务功能链设计及映射算法

朱国晖, 刘璐, 雷兰洁   

  1. 西安邮电大学 通信与信息工程学院, 西安 710061
  • 收稿日期:2019-05-29 修回日期:2019-07-25 出版日期:2020-04-15 发布日期:2019-07-05
  • 作者简介:朱国晖(1969-),男,副教授,主研方向为移动互联网、对等网络、复杂网络路由算法;刘璐、雷兰洁,硕士研究生。
  • 基金项目:
    国家自然科学基金(61371087)。

Service Function Chain Design and Mapping Algorithm Based on VNF Combination

ZHU Guohui, LIU Lu, LEI Lanjie   

  1. School of Communications and Information Engineering, Xi'an University of Posts and Telecommunications, Xi'an 710061, China
  • Received:2019-05-29 Revised:2019-07-25 Online:2020-04-15 Published:2019-07-05

摘要: 为优化网络功能虚拟化中服务功能链的设计和映射过程,提高物理资源利用率,提出一种基于虚拟网络功能(VNF)组合的服务功能链设计及映射算法A-VNFC。使用整数线性规划(ILP)模型,在小规模物理网络中求出目标函数总带宽消耗(TBC)的最优解,寻找可组合的VNF,并利用VNF决策树检查所有组合策略,通过迭代和优化降低TBC。仿真结果表明,A-VNFC算法可在不同场景下有效降低带宽消耗,其TBC数值接近ILP模型获得的最小带宽消耗值。

关键词: 网络功能虚拟化, 服务功能链, 虚拟网络功能, 整数线性规划, 带宽消耗

Abstract: In order to optimize the design and mapping of service function chains in Network Function Virtualization (NFV) and improve the utilization of physical resources,this paper proposes a service function chain design and mapping algorithm A-VNFC based on Virtual Network Function(VNF) combination.The design uses the Integer Linear Programming(ILP) model to find the optimal solution of the Total Bandwidth Consumption(TBC) of the objective function in a small-scale physical network.It searches for combinable VNFs,and uses the VNF decision tree to check all combination strategies,reducing TBC through iteration and optimization.Simulation results show that the proposed A-VNFC algorithm can effectively reduce bandwidth consumption in different scenarios,and its TBC value is close to the minimum bandwidth consumption value obtained by the ILP model.

Key words: Network Function Virtualization(NFV), Service Function Chain(SFC), Virtual Network Function(VNF), Integer Linear Programming(ILP), bandwidth consumption

中图分类号: