Scalable Routing in SDN-enabled Networks with Consolidated Middleboxes

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%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Guo

Concurrency and Computation

et al. 2019

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)

“…Network Function Virtualization (NFV) [2], [3], [7], [16] is emerging as a promising paradigm that is shaping the future networking landscape, by not only bringing the promise of enabling inexpensive and flexible management solutions but also introducing new challenges to the area of network management. Today's data centers and communication networks deploy a variety of intermediary middleboxes, e.g., firewalls, Intrusion Detection Systems (IDSs), proxies, and WAN optimizers, to guarantee the security and performance of data transfers.…”

Section: Introductionmentioning

confidence: 99%

Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs

Liang

Huang

et al. 2017

Multicasting is a fundamental functionality of networks for many applications, including online conferencing, event monitoring, video streaming, and system monitoring in data centers. To ensure multicasting reliable, secure and scalable, a service chain consisting of network functions (e.g., firewalls, Intrusion Detection Systems (IDSs), and transcoders) usually is associated with each multicast request, which we refer to as an NFV-enabled multicast request. In this paper we study NFV-enabled multicasting in a Software-Defined Network (SDN) with the aim to minimize the implementation cost of each NFVenabled multicast request and maximize the network throughput of a sequence of NFV-enabled requests, subject to resource capacity constraints on servers and links. We first formulate novel NFV-enabled multicasting and online NFV-enabled multicasting problems. We then devise the very first approximation algorithm with an approximation ratio of 2K for the NFV-enabled multicasting problem if the number of servers for implementing the network functions of each request is no more than a constant K (≥ 1). Furthermore, we also study dynamic admissions of NFV-enabled multicast requests without the knowledge of future request arrivals with the objective to maximize the network throughput, and propose an online algorithm with a competitive ratio of O(log n) for it if K = 1, where n is the number of nodes in the network. We finally evaluate the performance of the proposed algorithms through experimental simulations, and experimental results demonstrate that the proposed algorithms outperform other existing heuristics.

IEICE Trans. Inf. & Syst.

“…By using the consolidated middlebox, we can improve the performance of a service chain flow in an SDN/NFV enabled network through simplifying net- work traffic routing and saving resources of switches and machines. Recently, many efforts on how to implement efficient service chains with both traditional middlebox and consolidated middlebox have been published [3]- [5], which focus on creating an efficient routing scheme for the controller to steer traffic through the required middleboxes. However, these works basically assume that the middleboxes have fixed location.…”

Section: Introductionmentioning

confidence: 99%

Flow Clustering Based Efficient Consolidated Middlebox Positioning Approach for SDN/NFV-Enabled Network

Kim

2016

SUMMARYRecently in an SDN/NFV-enabled network, a consolidated middlebox is proposed in which middlebox functions required by a network flow are provided at a single machine in a virtualized manner. With the promising advantages such as simplifying network traffic routing and saving resources of switches and machines, consolidated middleboxes are going to replace traditional middleboxes in the near future. However, the location of consolidated middleboxes may affect the performance of an SDN/NFV network significantly. Accordingly, the consolidated middlebox positioning problem in an SDN/NFV-enabled network must be addressed adequately with service chain constraints (a flow must visit a specific type of consolidated middlebox), resource constraints (switch memory and processing power of the machine), and performance requirements (end-to-end delay and bandwidth consumption). In this paper, we propose a novel solution of the consolidated middlebox positioning problem in an SDN/NFVenabled network based on flow clustering to improve the performance of service chain flows and utilization of a consolidated middlebox. Via extensive simulations, we show that our solution significantly reduces the number of routing rules per switch, the end-to-end delay and bandwidth consumption of service flows while meeting service chain and resource constraints.