一种基于匹配博弈的服务链协同映射方法
|
摘要
针对软件定义网络(SDN)/网络功能虚拟化(NFV)环境下服务链映射难以兼顾效率与物理资源利用率的问题,该文提出一种基于匹配博弈的服务链协同映射方法。首先,以最大化网络资源效用为目标,建立服务链映射模型MUSCM;然后,分虚拟网络功能(VNF)部署和组链两个部分解决服务链映射问题,VNF部署部分,设计基于多对一匹配博弈理论的算法协同服务链和服务节点双方互相进行选择,有效提升了服务链的映射效率和物理资源的利用率,在此基础上,设计基于分段路由策略的算法实现各VNF实例间的流量牵引以完成VNF组链,有效降低了链路传输时延。实验结果表明,与经典算法相比,该算法在保证映射请求接受率的同时,有效降低了服务链的平均传输延时,提升了系统的物理资源利用率。
Considering that it is difficult to balance efficiency and resource utilization of Service Chain(SC)mapping problem in Software Defined Network(SDN)/Network Function Virtualization(NFV) environment,this paper proposes a collaborative mapping method for SC based on matching game. Firstly, it defines a SC mapping model named MUSCM to maximize the utility of network resources. Secondly, it divides the SC mapping problem into Virtual Network Function(VNF) deployment and connection parts. As for the VNF deployment part, an algorithm is designed to collaborate the selection of the SC and the service node based on many-to-one matching game, improving the mapping efficiency of SC and utilization of physical resource effectively. On the basis of it, an algorithm is designed based on segment routing strategy to accomplish the traffic steering between VNF instances to finish the VNF connection part, reducing the link transmission delay effectively. The experiment result shows that, compared with the classical algorithm, this algorithm ensures the mapping request received rate, and at the same time, it reduces the average transmission delay of the service chain and improves the physical resources utilization of the system effectively.
Considering that it is difficult to balance efficiency and resource utilization of Service Chain(SC)mapping problem in Software Defined Network(SDN)/Network Function Virtualization(NFV) environment,this paper proposes a collaborative mapping method for SC based on matching game. Firstly, it defines a SC mapping model named MUSCM to maximize the utility of network resources. Secondly, it divides the SC mapping problem into Virtual Network Function(VNF) deployment and connection parts. As for the VNF deployment part, an algorithm is designed to collaborate the selection of the SC and the service node based on many-to-one matching game, improving the mapping efficiency of SC and utilization of physical resource effectively. On the basis of it, an algorithm is designed based on segment routing strategy to accomplish the traffic steering between VNF instances to finish the VNF connection part, reducing the link transmission delay effectively. The experiment result shows that, compared with the classical algorithm, this algorithm ensures the mapping request received rate, and at the same time, it reduces the average transmission delay of the service chain and improves the physical resources utilization of the system effectively.
引文
[1]KREUTZ D,RAMOS F M V,VERíSSIMO P E,et al.Software-defined networking:A comprehensive survey[J].Proceedings of the IEEE,2015,103(1):14-76.doi:10.1109/JPROC.2014.2371999.
[2]MIJUMBI R,SERRAT J,GORRICHO J L,et al.Network function virtualization:State-of-the-art and research challenges[J].IEEE Communications Surveys and Tutorials,2017,18(1):236-262.doi:10.1109/COMST.2015.2477041.
[3]OCAMPO A F,GIL-HERRERA J,ISOLANI P H,et al.Optimal service function chain composition in network functions virtualization[C].International Conference onAutonomous Infrastructure,Management and Security,Zurich,Switzerland,2017:62-76.
[4]LI Yong and CHEN Min.Software-defined network function virtualization:A survey[J].IEEE Access,2015,3:2542-2553.doi:10.1109/ACCESS.2015.2499271.
[5]BHAMARE D,JAIN R,SAMAKA M,et al.A survey on service function chaining[J].Journal of Network and Computer Applications,2016,75:138-155.doi:10.1016/j.jnca.2016.09.001.
[6]DWARAKI A and WOLF T.Adaptive service-chain routing for virtual network functions in software-defined networks[C].The Workshop on Hot Topics in Middleboxes and Network Function Virtualization,Salvador,Brazil,2016:32-37.
[7]XIONG Gang,HU Yunxiang,LAN Julong,et al.Amechanism for configurable network service chaining and its implementation[J].KSII Transactions on Internet and Information Systems,2016,10(8):3701-3727.doi:10.3837/tiis.2016.08.016.
[8]SEKAR V,EGI N,RATNASAMY S,et al.Design and implementation of a consolidated middlebox architecture[C].Usenix Conference on Networked Systems Design and Implementation,Lombard,Italy,2012:24-34.
[9]KUO Tunwei,LIOU Bangheng,LIN Chingju,et al.Deploying chains of virtualnetwork functions:On the relation between link and server usage[C].IEEEInternational Conference on Computer Communications,San Francisco,USA,2016:1-9.
[10]ZHANG Qixia,XIAO Yikai,LIU Fangming,et al.Joint optimization of chain placement and request scheduling for network function virtualization[C].IEEE International Conference on Distributed Computing Systems,Atlanta,USA,2017:731-741.
[11]GALE D and SHAPLEY L S.College admissions and the stability of marriage[J].American Mathematical Monthly,1962,69(1):9-15.doi:10.4169/amer.math.monthly.120.05.386.
[12]XU Hong and LI Baochun.Anchor:A versatile and efficient framework for resource management in the cloud[J].IEEETransactions on Parallel and Distributed Systems,2013,24(6):1066-1076.doi:10.1109/TPDS.2012.308.
[13]ZHANG Yan and ANSARI N.Heterogeneity aware dominant resource assistant heuristics for virtual machine consolidation[C].Global Communications Conference,Austin,USA,2014:1297-1302.
[14]CORMEN T T,LEISERSON C E,RIVEST R L,et al.Introduction to Algorithms[M].Mc Graw,USA,MIT Press,2002:145-167.
[15]MANLOVE D.Algorithmics of Matching under Preferences[M].Glasgow,UK,World Scientific Pub.Co,2013:266-278.
[16]FILSFILS C,NAINAR N K,PIGNATARO C,et al.The segment routing architecture[C].Global Communications Conference,San Diego,USA,2015:1-6.
[17]CALVERT K L and BHATTACHARJEE S.How to model an internetwork[C].IEEE Conference of Computer Societies,San Francisco,USA,1996:594-602.
[2]MIJUMBI R,SERRAT J,GORRICHO J L,et al.Network function virtualization:State-of-the-art and research challenges[J].IEEE Communications Surveys and Tutorials,2017,18(1):236-262.doi:10.1109/COMST.2015.2477041.
[3]OCAMPO A F,GIL-HERRERA J,ISOLANI P H,et al.Optimal service function chain composition in network functions virtualization[C].International Conference onAutonomous Infrastructure,Management and Security,Zurich,Switzerland,2017:62-76.
[4]LI Yong and CHEN Min.Software-defined network function virtualization:A survey[J].IEEE Access,2015,3:2542-2553.doi:10.1109/ACCESS.2015.2499271.
[5]BHAMARE D,JAIN R,SAMAKA M,et al.A survey on service function chaining[J].Journal of Network and Computer Applications,2016,75:138-155.doi:10.1016/j.jnca.2016.09.001.
[6]DWARAKI A and WOLF T.Adaptive service-chain routing for virtual network functions in software-defined networks[C].The Workshop on Hot Topics in Middleboxes and Network Function Virtualization,Salvador,Brazil,2016:32-37.
[7]XIONG Gang,HU Yunxiang,LAN Julong,et al.Amechanism for configurable network service chaining and its implementation[J].KSII Transactions on Internet and Information Systems,2016,10(8):3701-3727.doi:10.3837/tiis.2016.08.016.
[8]SEKAR V,EGI N,RATNASAMY S,et al.Design and implementation of a consolidated middlebox architecture[C].Usenix Conference on Networked Systems Design and Implementation,Lombard,Italy,2012:24-34.
[9]KUO Tunwei,LIOU Bangheng,LIN Chingju,et al.Deploying chains of virtualnetwork functions:On the relation between link and server usage[C].IEEEInternational Conference on Computer Communications,San Francisco,USA,2016:1-9.
[10]ZHANG Qixia,XIAO Yikai,LIU Fangming,et al.Joint optimization of chain placement and request scheduling for network function virtualization[C].IEEE International Conference on Distributed Computing Systems,Atlanta,USA,2017:731-741.
[11]GALE D and SHAPLEY L S.College admissions and the stability of marriage[J].American Mathematical Monthly,1962,69(1):9-15.doi:10.4169/amer.math.monthly.120.05.386.
[12]XU Hong and LI Baochun.Anchor:A versatile and efficient framework for resource management in the cloud[J].IEEETransactions on Parallel and Distributed Systems,2013,24(6):1066-1076.doi:10.1109/TPDS.2012.308.
[13]ZHANG Yan and ANSARI N.Heterogeneity aware dominant resource assistant heuristics for virtual machine consolidation[C].Global Communications Conference,Austin,USA,2014:1297-1302.
[14]CORMEN T T,LEISERSON C E,RIVEST R L,et al.Introduction to Algorithms[M].Mc Graw,USA,MIT Press,2002:145-167.
[15]MANLOVE D.Algorithmics of Matching under Preferences[M].Glasgow,UK,World Scientific Pub.Co,2013:266-278.
[16]FILSFILS C,NAINAR N K,PIGNATARO C,et al.The segment routing architecture[C].Global Communications Conference,San Diego,USA,2015:1-6.
[17]CALVERT K L and BHATTACHARJEE S.How to model an internetwork[C].IEEE Conference of Computer Societies,San Francisco,USA,1996:594-602.