Fairness-aware dynamic rate control and flow scheduling for network function virtualization

Abstract

By softwarizing traditional dedicated hardware based functions to virtualized network functions (VNFs) that can run on standard commodity servers, network function virtualization (NFV) technology promises high efficiency, flexibility and scalability. To NFV service providers, one primary concern is to maximize network throughput and reduce service time. To reach this goal, two main challenges should be tackled: 1) how to schedule the unpredictable and burst network flows; 2) how to fairly allocate resources between various flows with different resource requirements. In this paper, we are motivated to investigate a throughput maximization problem with joint consideration of fairness between multiple flows using a discrete time queuing model. By taking advantages of Lyapunov optimization techniques, we propose a low-complexity online distributed algorithm that can achieve arbitrary optimal utility with different fairness levels by tuning the fairness bias. The high efficiency of our proposal is validated by both theoretical analysis and extensive simulation studies.