Position-aware packet loss optimization on service function chain placement

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, Palosis 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.