Computer Science

Computer Science ›› 2023, Vol. 50 ›› Issue (6): 66-73.doi: 10.11896/jsjkx.220400156

• High Performance Computing • Previous Articles     Next Articles

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)

3707

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

CLC Number: 

  • 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.
[1] YANG Da, LUO Liang, ZHENG Long. New Global Optimization Algorithm:Carbon Cycle Algorithm [J]. Computer Science, 2023, 50(6A): 220300131-7.
[2] GENG Hai-jun, WANG Wei, YIN Xia. Single Node Failure Routing Protection Algorithm Based on Hybrid Software Defined Networks [J]. Computer Science, 2022, 49(2): 329-335.
[3] LIU Wen-wen, XIONG Wei, HAN Chi. Communication Satellite Task Relaxation Scheduling Method Based on Improved Hyper-heuristic Algorithm [J]. Computer Science, 2022, 49(11A): 210900125-6.
[4] CAI Yue, WANG En-liang, SUN Zhe, SUN Zhi-xin. Study on Dual Sequence Decision-making for Trucks and Cargo Matching Based on Dual Pointer Network [J]. Computer Science, 2022, 49(11A): 210800257-9.
[5] LIU Zhong-hui, ZHAO Qi, ZOU Lu, MIN Fan. Heuristic Construction of Triadic Concept and Its Application in Social Recommendation [J]. Computer Science, 2021, 48(6): 234-240.
[6] GUO Qi-cheng, DU Xiao-yu, ZHANG Yan-yu, ZHOU Yi. Three-dimensional Path Planning of UAV Based on Improved Whale Optimization Algorithm [J]. Computer Science, 2021, 48(12): 304-311.
[7] WANG Ke, QU Hua, ZHAO Ji-hong. Multi-objective Optimization Method Based on Reinforcement Learning in Multi-domain SFC Deployment [J]. Computer Science, 2021, 48(12): 324-330.
[8] GAO Ming, ZHOU Hui-ying, JIAO Hai, YING Li-li. Link Mapping Algorithm Based on Weighted Graph [J]. Computer Science, 2021, 48(11A): 476-480.
[9] GUO Fei-yan, TANG Bing. Mobile Edge Server Placement Method Based on User Latency-aware [J]. Computer Science, 2021, 48(1): 103-110.
[10] ZHANG Xu, WANG Li-li, YANG Bo-tao. Heuristic Algorithms for Two-dimensional Irregular Bin Packing Problem with GuillotineConstraints [J]. Computer Science, 2020, 47(5): 212-216.
[11] YANG Ting, LUO Fei, DING Wei-chao, LU Hai-feng. Bin Packing Algorithm Based on Adaptive Optimization of Slack [J]. Computer Science, 2020, 47(4): 211-216.
[12] ZHANG Zhao, LI Hai-long, HU Lei, DONG Si-qi. Service Function Load Balancing Based on SDN-SFC [J]. Computer Science, 2019, 46(9): 130-136.
[13] LUO Fei, REN Qiang, DING Wei-chao, LU Hai-feng. Heuristic One-dimensional Bin Packing Algorithm Based on Minimum Slack [J]. Computer Science, 2019, 46(9): 315-320.
[14] ZHANG Shu-yu, DONG Da, XIE Bing, LIU Kai-gui. Bus Short-term Dynamic Dispatch Algorithm Based on Real-time GPS [J]. Computer Science, 2019, 46(6A): 497-501.
[15] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading [J]. Computer Science, 2018, 45(4): 94-99.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
Add:18# Honghu West Rd., Yubei ,Chongqing,China    Post Code: 401121
Tel: 023-63500828/023-67039612/023-67039623
E-mail: jsjkx12@163.com
Powered by Beijing Magtech Co., Ltd.