计算机科学

计算机科学 ›› 2023, Vol. 50 ›› Issue (6): 66-73.doi: 10.11896/jsjkx.220400156

• 高性能计算 • 上一篇    下一篇

一种面向最佳收益的服务功能链在线编排方法

黄骅1,3, 江俊2, 杨永康3, 曹斌1   

  1. 1 浙江工业大学计算机科学与技术、软件学院 杭州 310014
    2 浙江树人大学信息科技学院 杭州 310015
    3 东方通信股份有限公司博士后科研工作站 杭州 310053
  • 收稿日期:2022-04-14 修回日期:2022-09-30 出版日期:2023-06-15 发布日期:2023-06-06
  • 通讯作者: 江俊(heifetz@zju.edu.cn)
  • 作者简介:(huanghua@eastcom.com)
  • 基金资助:
    浙江省重点研发计划 (2022C01145);浙江省教育厅科研项目(Y202146607)

Online Service Function Chain Orchestration Method for Profit Maximization

HUANG Hua1,3, JIANG Jun2, YANG Yongkang3, CAO Bin1   

  1. 1 College of Computer Science and Software,Zhejiang University of Technology,Hangzhou 310014,China
    2 College of Information Science and Electrical Engineering,Zhejiang Shuren University,Hangzhou 310015,China
    3 Central Research Institute of Eastern Communications Co.,Ltd.,Hangzhou 310053,China
  • Received:2022-04-14 Revised:2022-09-30 Online:2023-06-15 Published:2023-06-06
  • About author:HUANG Hua,born in 1983,Ph.D,senior engineer.His main research interests include network virtualization,business process management and service computing.JIANG Jun,born in 1983,Ph.D,asso-ciate professor.His main research inte-rests include artificial intelligence,data mining and big data processing.
  • Supported by:
    Key Research and Development Program of Zhejiang Province(2022C01145) and Scientific Research Foundation of the Education Department of Zhejiang Province(Y202146607).

PDF (PC)

3699

摘要： 随着网络功能虚拟化技术的发展,如何对服务功能链进行灵活编排以实现收益最大化已成为服务提供商关注的核心问题。文中以最大化收益为目标,将多数据中心场景下的服务功能链在线编排问题建模为0-1整数规划,并在此基础上提出了一种两阶段启发式算法。在第一阶段,根据负载情况及部署开销计算节点和链路的权重值,将服务功能链部署在优先级最高的节点上,然后根据链路的负载情况选取满足带宽约束且优先级最高的链路。在第二阶段,类比最长有效功能序列方法,提出了一种虚拟服务迁移策略,以降低部署资源消耗。基于NSFNET和USNET网络拓扑设计了仿真实验,实验结果表明,相比现有算法,所提方法在部署收益和部署成功率两个方面均有一定提升,能够实现服务资源的优化配置,有效提升部署收益。

关键词: 服务功能链, 虚拟网络功能, 功能复用, 启发式算法, 组合优化

Abstract: With the development of network function virtualization technology,how to deploy service function chain flexibly to maximize the profit has become one of the major challenging issues for network service providers.In this paper,we formulate the service function orchestration problem for multi-data center as 0-1 integer programming with the aim to maximize the profit,and propose a two-stage heuristic algorithm to solve this problem.In the first stage,the weights of nodes and links are calculated according to the load condition and deployment cost,the service function chain is deployed on the node with the highest priority,then the link with the highest priority that meets the bandwidth constraint is selected according to the load condition.In the se-cond stage,by analogy with the longest effective function sequence method,a virtualized network function migration strategy is proposed to reduce the consumption of deployment resources.Simulation experiment is designed based on NSFNET and USNET network topology.Experimental results show that,compared with existing algorithms,the proposed method has a certain improvement in both total profit and deployment success rate.

Key words: Service function chain, Virtualized network function, Function reuse, Heuristic algorithm, Combinatorial optimization

中图分类号: 

  • TP393.01
[1]CHATRAS B,OZOG F F.Network Functions Virtualization:The Portability Challenges[J].IEEE Network,2016,30(4):4-8.
[2]SONG Y,FAN L,STOJAN T,et al.Recent Advances of Resource Allocation in Network Function Virtualization[J].IEEE Transaction on Parallel and Distributed Systems,2021,2(2):295-314.
[3]HERRERA J G,BOTERO J F.Resource Allocation in NFV:AComprehensive Survey[J].IEEE Transactions on Network and Service Management,2017,13(3):518-532.
[4]GHAZNAVI M,SHAHRIAR N,KAMALI S,et al.Distributed Service Function Chaining[J].IEEE Journal on Selected Areas in Communications,2017,35(11):2479-2489.
[5]HAN B,GOPALAKRISHNAN V,JI L,et al.Network function virtualization:Challenges and opportunities for innovations[J].IEEE Communications Magazine,2015,53(2):90-97.
[6]MIJUMBI R,SERRAT J,GORRICHO J L,et al.Management and Orchestration Challenges in Network Functions Virtualization[J].IEEE Communications Magazine,2016,54(1):98-105.
[7]SUN G,XU Z,YU H,et al.Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization[J].IEEE Internet of Things Journal,2020,7(7):5760-5772.
[8]LI G,REN Y,LIU Y.A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game[J].Mathematical Problems in Engineering,2021,2021:1-12.
[9]WANG Y,LU P,LU W,et al.Cost-Efficient Virtual NetworkFunction Graph(vNFG) Provisioning in Multidomain Elastic Optical Networks[J].Journal of Lightwave Technology,2017,35(13):2712-2723.
[10]ZHAI D,MENG X R,KANG Q Y,et al.Service Function Chain Deployment Method for Delay and Reliability Optimization[J].Journal of Electronics & Information Technology,2020,42(10):2386-2393.
[11]HUANG M G,WANG T,LIU L,et al.Virtual Network Function Deployment Strategy Based on Software Defined Network Resource Optimization [J].Computer Science,2020,47(1):404-408.
[12]WANG K,QU H,ZHAO J H.Multi-object Optimization Me-thod Based on Reinforcement Learning in Multi-domain SFC deployment[J].Computer Science,2021,48(12):324-330.
[13]RACHEG W,GHRADA N,ZHANI M.Profit-driven resourceprovisioning in NFV-based environments[C]//IEEE International Conference on Communications.2017:1-7.
[14]ZENG M,FANG W,ZHU Z.Orchestrating tree-type VNF forwarding graphs in inter-DC optical networks[J].Journal of Lightwave Technology,2016,34(14):3330-3341.
[15]MA Y,LIANG W,XU Z,et al.Profit Maximization for Admitting Requests with Network Function Services in Distributed Clouds[J].IEEE Transactions on Parallel and Distributed Systems,2019,30(5):1143-1157.
[16]FANG W,ZENG M,LIU X,et al.Joint Spectrum and IT Resource Allocation for Efficient VNF Service Chaining in Inter-Datacenter Elastic Optical Networks[J].IEEE Communication Letters,2016,20(8):1539-1542.
[17]KUO T,LIOU B,LIN K C,et al.Deploying chains of virtualnetwork functions:On the relation between link and server usage[J].IEEE Transactions on Networking,2018,26(4):1562-1576.
[18]LI D,LAN J L,WANG P,et al.Service Function Chain Deployment Algorithm Based on Longest Effective Function Sequence[J].Journal of Electronics and Information Technology,2019,41(3):680-686.
[19]YU H,CHEN Z,SUN G,et al.Profit Maximization of Online Service Function Chain Orchestration in an Inter-Datacenter Elastic Optical Network[J].IEEE Transactions on Network and Service Management,2021,18(1):973-985.
[20]ZHAO D,REN J,LIN R,et al.On Orchestrating Service Function Chains in 5G Mobile Network[J].IEEE Access,2019,7:39402-39416.
[21]MANZANARES-LOPEZ P,MUOZ-GEA J P,MALGOSA-SANAHUJA J.VNF Placement for Service Function Chains with Strong Low-Delay Restrictions in Edge Computing Networks[J].Applied Sciences,2020,10(18):6573-6595.
[22]YEN J.Finding the k shortest loopless paths in a network[J].management science,1971,17(11):712-716.
[23]MA Y,LIANG W,XU Z,et al.Profit Maximization for Admitting Request with Network Function Services in Distributed Clouds[J].IEEE Transactions on Parallel and Distributed Systems,2018,30(5):1143-1157.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
地址：重庆市渝北区洪湖西路18号    邮编：401121  
电话：023-63500828（编辑部） 023-67039612（会议/专题） 023-67039623（财务/发票）
E-mail：jsjkx12@163.com
本系统由北京玛格泰克科技发展有限公司设计开发