安全服务链中虚拟网络功能分配与调度算法研究
|
摘要
安全服务链中的虚拟网络功能(virtual network function,VNF)将传统网络安全功能与硬件设备解耦,使得服务功能的部署更具动态性和可扩展性。然而VNF向节点的合理分配以及节点上VNF的高效调度问题仍亟待解决。为此,基于软件定义网络(software defined network,SDN)和网络功能虚拟化(network function virtuali-zation,NFV)环境,提出基于优化算法的解决方案。对资源分配与调度问题进行举例并形式化定义问题的优化目标,提出基于贪心算法的资源分配方案和基于混合蜂群算法的资源调度方案,统一协调解决VNF的资源分配与调度问题。仿真实验验证,所提算法的时间复杂性和在总资源成本及总服务收益方面的提升,对比混合蜂群算法和传统蜂群算法,结果显示前者具有更快的收敛速度。
The virtual network function in the security service chain decouples the traditional network security functions from the hardware devices,making the deployment of service functions more dynamic and extensible. However,the rational allocation of the VNF to the node and the efficient scheduling of the VNF on the node still need to be solved urgently. To this end,this paper presented a solution using optimization algorithm based on the software defined network and network function virtualization environment. First,it made an example of resource allocation and scheduling problem and formalized the objective.Then,this paper proposed a resource allocation scheme based on greedy algorithm and a resource scheduling scheme based on hybrid bee colony algorithm to solve the problem coordinately. Finally,it designed the simulation experiment to verify the time complexity and the improvement of total resource cost and total service income of the proposed algorithm. Meanwhile,it compared the hybrid bee colony algorithm with the traditional bee colony algorithm. The results indicate that the former has better convergence rate.
The virtual network function in the security service chain decouples the traditional network security functions from the hardware devices,making the deployment of service functions more dynamic and extensible. However,the rational allocation of the VNF to the node and the efficient scheduling of the VNF on the node still need to be solved urgently. To this end,this paper presented a solution using optimization algorithm based on the software defined network and network function virtualization environment. First,it made an example of resource allocation and scheduling problem and formalized the objective.Then,this paper proposed a resource allocation scheme based on greedy algorithm and a resource scheduling scheme based on hybrid bee colony algorithm to solve the problem coordinately. Finally,it designed the simulation experiment to verify the time complexity and the improvement of total resource cost and total service income of the proposed algorithm. Meanwhile,it compared the hybrid bee colony algorithm with the traditional bee colony algorithm. The results indicate that the former has better convergence rate.
引文
[1]黄韬,刘江,霍如,等.未来网络体系架构研究综述[J].通信学报,2014,35(8):184-197.(Huang Tao,Liu Jiang,Huo Ru,et al. Survey of research on future network architectures[J]. Jour-nal on Communications,2014,35(8):184-197.)
[2]兰巨龙,程东年,胡宇翔.可重构信息通信基础网络体系研究[J].通信学报,2014,35(1):128-139.(Lan Julong,ChengDongnian,Hu Yuxiang. Research on reconfigurable information com-munication basal network architecture[J]. Journal on Communi-cations,2014,35(1):128-139.)
[3] Mc Keown N,Anderson T,Balakrishnan H,et al. OpenFlow:enab-ling innovation in campus networks[J]. ACM SIGCOMM Compu-ter Communication Review,2008,38(2):69-74.
[4]左青云,陈鸣,赵广松,等.基于OpenFlow的SDN技术研究[J].软件学报,2013,24(5):1078-1097.(Zuo Qingyun,ChenMing,Zhao Guangsong,et al. Research on OpenFlow-based SDNtechnologies[J]. Journal of Software,2013,24(5):1078-1097.)
[5]熊钢,胡宇翔,段通,等.一种软件定义网络的安全服务链动态组合机制[J].电子与信息学报,2016,38(5):1234-1241.(Xiong Gang,Hu Yuxiang,Duan Tong,et al. A dynamic compositionmechanism for the security service chain oriented software defined net-working[J]. Journal of Electronics&Information Technology,2016,38(5):1234-1241.)
[6] Liu Jiaqiang,Li Yong,Wang Huandong,et al. Leveraging software-defined networking for security policy enforcement[J]. InformationSciences,2016,327(1):288-299.
[7] Clayman S,Maini E,Galis A,et al. The dynamic placement of vir-tual network functions[C]//Proc of the 12th IEEE Network Opera-tions and Management Symposium. New York:ACM Press,2014:617-624.
[8] Mijumbi R,Serrat J,Gorricho J L,et al. Network function virtualiza-tion:state-of-the-art and research challenges[J]. IEEE Communi-cations Surveys&Tutorials,2016,18(1):236-262.
[9] Herrera J G,Botero J F. Resource allocation in NFV:a comprehen-sive survey[J]. IEEE Trans on Network&Service Manage-ment,2017,13(3):518-532.
[10]Riera J F,Hesselbach X,Escalona E,et al. On the complex schedu-ling formulation of virtual network functions over optical networks[C]//Proc of the 10th IEEE International Conference on TransparentOptical Networks. Piscataway,NJ:IEEE Press,2014:210-217.
[11] Riera J F,Escalona E,Batalle J,et al. Virtual network functionscheduling:concept and challenges[C]//Proc of the 9th IEEE In-ternational Conference on Smart Communications in Network Techno-logies. Piscataway,NJ:IEEE Press,2014:105-116.
[12]Mijumbi R,Serrat J,Gorricho J L,et al. Design and evaluation ofalgorithms for mapping and scheduling of virtual network functions[C]//Proc of the 1st IEEE Conference on Network Softwarization.Piscataway,NJ:IEEE Press,2015:211-219.
[13]Fischer A,Botero J F,Beck M T,et al. Virtual network embedding:a survey[J]. IEEE Communications Surveys&Tutorials,2013,15(4):1888-1906.
[14]Rabbani M G,Esteves R P,Podlesny M,et al. On tackling virtualdata center embedding problem[C]//Proc of IFIP/IEEE Internatio-nal Symposium on Integrated Network Management. Piscataway,NJ:IEEE Press,2013:177-184.
[15]Karaboga D. An idea based on honey bee swarm for numerical optimi-zation[EB/OL].(2009-10-05)[2016-03-21]. http://dx. doi. org/10. 2139/ssrn. 20090014.
[16]Chong C S,Low M Y H,Sivakumar A I,et al. Using a bee colonyalgorithm for neighborhood search in Job-Shop scheduling problems[C]//Proc of the 9th European Conference on Modelling&Simula-tion:Simulations in United Europe. New York:ACM Press,2008:1207-1218.
[17]Wong Lipei,Puan C Y,Low M Y H,et al. Bee colony optimizationalgorithm with big valley landscape exploitation for Job-Shop schedu-ling problems[C]//Proc of the 40th Conference on Winter Simula-tion Winter Simulation Conference. New York:ACM Press,2008:2050-2058.
[18]Teodorovic D,Lucic P,Markovic G,et al. Bee colony optimization:principles and applications[C]//Proc of the 10th IEEE Seminar onNeural Network Applications in Electrical Engineering. New York:ACM Press,2007:151-156.
[2]兰巨龙,程东年,胡宇翔.可重构信息通信基础网络体系研究[J].通信学报,2014,35(1):128-139.(Lan Julong,ChengDongnian,Hu Yuxiang. Research on reconfigurable information com-munication basal network architecture[J]. Journal on Communi-cations,2014,35(1):128-139.)
[3] Mc Keown N,Anderson T,Balakrishnan H,et al. OpenFlow:enab-ling innovation in campus networks[J]. ACM SIGCOMM Compu-ter Communication Review,2008,38(2):69-74.
[4]左青云,陈鸣,赵广松,等.基于OpenFlow的SDN技术研究[J].软件学报,2013,24(5):1078-1097.(Zuo Qingyun,ChenMing,Zhao Guangsong,et al. Research on OpenFlow-based SDNtechnologies[J]. Journal of Software,2013,24(5):1078-1097.)
[5]熊钢,胡宇翔,段通,等.一种软件定义网络的安全服务链动态组合机制[J].电子与信息学报,2016,38(5):1234-1241.(Xiong Gang,Hu Yuxiang,Duan Tong,et al. A dynamic compositionmechanism for the security service chain oriented software defined net-working[J]. Journal of Electronics&Information Technology,2016,38(5):1234-1241.)
[6] Liu Jiaqiang,Li Yong,Wang Huandong,et al. Leveraging software-defined networking for security policy enforcement[J]. InformationSciences,2016,327(1):288-299.
[7] Clayman S,Maini E,Galis A,et al. The dynamic placement of vir-tual network functions[C]//Proc of the 12th IEEE Network Opera-tions and Management Symposium. New York:ACM Press,2014:617-624.
[8] Mijumbi R,Serrat J,Gorricho J L,et al. Network function virtualiza-tion:state-of-the-art and research challenges[J]. IEEE Communi-cations Surveys&Tutorials,2016,18(1):236-262.
[9] Herrera J G,Botero J F. Resource allocation in NFV:a comprehen-sive survey[J]. IEEE Trans on Network&Service Manage-ment,2017,13(3):518-532.
[10]Riera J F,Hesselbach X,Escalona E,et al. On the complex schedu-ling formulation of virtual network functions over optical networks[C]//Proc of the 10th IEEE International Conference on TransparentOptical Networks. Piscataway,NJ:IEEE Press,2014:210-217.
[11] Riera J F,Escalona E,Batalle J,et al. Virtual network functionscheduling:concept and challenges[C]//Proc of the 9th IEEE In-ternational Conference on Smart Communications in Network Techno-logies. Piscataway,NJ:IEEE Press,2014:105-116.
[12]Mijumbi R,Serrat J,Gorricho J L,et al. Design and evaluation ofalgorithms for mapping and scheduling of virtual network functions[C]//Proc of the 1st IEEE Conference on Network Softwarization.Piscataway,NJ:IEEE Press,2015:211-219.
[13]Fischer A,Botero J F,Beck M T,et al. Virtual network embedding:a survey[J]. IEEE Communications Surveys&Tutorials,2013,15(4):1888-1906.
[14]Rabbani M G,Esteves R P,Podlesny M,et al. On tackling virtualdata center embedding problem[C]//Proc of IFIP/IEEE Internatio-nal Symposium on Integrated Network Management. Piscataway,NJ:IEEE Press,2013:177-184.
[15]Karaboga D. An idea based on honey bee swarm for numerical optimi-zation[EB/OL].(2009-10-05)[2016-03-21]. http://dx. doi. org/10. 2139/ssrn. 20090014.
[16]Chong C S,Low M Y H,Sivakumar A I,et al. Using a bee colonyalgorithm for neighborhood search in Job-Shop scheduling problems[C]//Proc of the 9th European Conference on Modelling&Simula-tion:Simulations in United Europe. New York:ACM Press,2008:1207-1218.
[17]Wong Lipei,Puan C Y,Low M Y H,et al. Bee colony optimizationalgorithm with big valley landscape exploitation for Job-Shop schedu-ling problems[C]//Proc of the 40th Conference on Winter Simula-tion Winter Simulation Conference. New York:ACM Press,2008:2050-2058.
[18]Teodorovic D,Lucic P,Markovic G,et al. Bee colony optimization:principles and applications[C]//Proc of the 10th IEEE Seminar onNeural Network Applications in Electrical Engineering. New York:ACM Press,2007:151-156.