Position-aware packet loss optimization on service function chain placement  

作　　者：Wenjie Liang Chengxiang Li Lin Cui Fung Po Tso 

机构地区：[1]Department of Computer Science,Jinan University,Guangzhou,510632,China [2]Department of Computer Science,Loughborough University,Loughborough,LE113TU,UK

出　　处：《Digital Communications and Networks》2024年第4期1057-1067,共11页数字通信与网络（英文版）

基　　金：supported by the National Natural Science Foundation of China(NSFC)No.62172189 and 61772235;the Natural Science Foundation of Guangdong Province No.2020A1515010771;the Science and Technology Program of Guangzhou No.202002030372;the UK Engineering and Physical Sciences Research Council(EPSRC)grants EP/P004407/2 and EP/P004024/1,and Innovate UK grant 106199-47198.

摘　　要：The advent of Network Function Virtualization(NFV)and Service Function Chains(SFCs)unleashes the power of dynamic creation of network services using Virtual Network Functions(VNFs).This is of great interest to network operators since poor service quality and resource wastage can potentially hurt their revenue in the long term.However,the study shows with a set of test-bed experiments that packet loss at certain positions(i.e.,different VNFs)in an SFC can cause various degrees of resource wastage and performance degradation because of repeated upstream processing and transmission of retransmitted packets.To overcome this challenge,this study focuses on resource scheduling and deployment of SFCs while considering packet loss positions.This study developed a novel SFC packet dropping cost model and formulated an SFC scheduling problem that aims to minimize overall packet dropping cost as a Mixed-Integer Linear Programming(MILP)and proved that it is NP-hard.In this study,Palos is proposed as an efficient scheme in exploiting the functional characteristics of VNFs and their positions in SFCs for scheduling resources and deployment to optimize packet dropping cost.Extensive experiment results show that Palos can achieve up to 42.73%improvement on packet dropping cost and up to 33.03%reduction on average SFC latency when compared with two other state-of-the-art schemes.

关 键 词：Network function virtualization Resource scheduling SFC deployment Packet loss 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]