Network functions virtualization with soft real-time guarantees

Guo

Concurrency and Computation

et al. 2019

Summary Data transmission in current networks is usually associated with strict priority enforcement for the purpose of quality of service (QoS). Under the case that priority flow requests are injected into the network sequentially without the information of future flow request arrivals, it is a challenging to achieve network throughput maximization for on‐line flow requests under the joint constraints of the flow's priority, bandwidth demand, and resource capacity. Software Defined Networking (SDN) can effectively solve the flow scheduling equilibrium problem between the priority of dynamic flow requests and the maximization of network throughput. Therefore, in this paper, we study on‐line flow request admission in SDN, the goal of which is to maximize the network throughput under the constraints of critical network bandwidth resources, flow priority, and bandwidth demands. First, we present the concept of flow routing cost and profit and a model to characterize the cost of using link resources and routing paths. Then, we propose an efficient on‐line priority flow scheduling algorithm (OPFSA) to solve priority flow request scheduling problem and analyze the competitive ratio of OPFSA. Our on‐line algorithm can reach throughput within Ofalse(1normallnormalonormalgnfalse) of the highest possible throughput that can be achieved by an off‐line algorithm, where n is the number of node in the network. Finally, experimental results demonstrate that compared with SHORTEST‐SC, our proposed algorithm can enhance the cumulative bandwidth about 9% and 40% when general network size is 30 and 170 nodes, respectively, and improve the throughput about 25% in Fat‐tree network when pod size is 4.

“…Some works focused on flow splitting routing in the hybrid SDN . Specifically, Xu et al studied a throughput‐maximization routing for incremental deployment of hybrid network.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Priority‐based online flow scheduling for network throughput maximization in software defined networking

Guo

Concurrency and Computation

et al. 2019

“…Recently, Wang et al [7] developed a fast online algorithm for scaling and provisioning VNFs in a data center. However, they are not considering timingsensitive applications with deadlines for the packets moving through the chain, which is done by Li et al [8] where they present a design and implementation of NFV-RT that aims at controlling NFVs with soft real-time guarantees, allowing packets to have deadlines.…”

Section: Related Workmentioning

confidence: 99%

AutoSAC: automatic scaling and admission control of forwarding graphs

2017

There is a strong industrial drive to use cloud computing technologies and concepts for providing timing sensitive services in the networking domain since it would provide the means to share the physical resources among multiple users and thus increase the elasticity and reduce the costs. In this work, we develop a mathematical model for user-stateless virtual network functions forming a forwarding graph. The model captures uncertainties of the performance of these virtual resources as well as the time-overhead needed to instantiate them. The model is used to derive a service controller for horizontal scaling of the virtual resources as well as an admission controller that guarantees that packets exiting the forwarding graph meet their end-to-end deadline. The Automatic Service and Admission Controller (AutoSAC) developed in this work uses feedback and feedforward making it robust against uncertainties of the underlying infrastructure. Also, it has a fast reaction time to changes in the input.

2017 IEEE International Conference on Communications (ICC)

“…Recently, Wang et al [6] developed a fast online algorithm for scaling and provisioning VNFs in a data center. However, they are not considering timingsensitive applications with deadlines for the packets moving through the chain, which is done by Li et al [7] where they present a design and implementation of NFV-RT that aims at controlling NFVs with soft Real-Time guarantees, allowing packets to have deadlines.…”

Section: Related Workmentioning

confidence: 99%

Dynamic control of NFV forwarding graphs with end-to-end deadline constraints

Millnert

Eker

Bini

2017

Abstract-There is a strong industrial drive to use cloud computing technologies and concepts for providing timing sensitive services in the networking domain since it would provide the means to share the physical resources among multiple users and thus increase the elasticity and reduce the costs. In this work, we develop a mathematical model for user-stateless virtual network functions forming a forwarding graph. The model captures uncertainties of the performance of these virtual resources as well as the time-overhead needed to instantiate them. The model is used to derive a service controller for horizontal scaling of the virtual resources as well as an admission controller that guarantees that packets exiting the forwarding graph meet their end-to-end deadline. The Automatic Service and Admission Controller (AutoSAC) developed in this work uses feedback and feedforward making it robust against uncertainties of the underlying infrastructure. Also, it has a fast reaction time to changes in the input.