Please use this identifier to cite or link to this item:
Title: Throughput maximization in software-defined networks with consolidated middleboxes
Authors: Huang, M
Liang, W
Xu, Z
Jia, M
Guo, S 
Keywords: Consolidated middleboxes
Network function virtualization
Network resource allocation
Routing algorithms
Software-defined networking
Issue Date: 2016
Publisher: IEEE Computer Society
Source: Proceedings - Conference on Local Computer Networks, LCN, 2016, 7796802, p. 298-306 How to cite?
Abstract: Today's computer networks rely on a wide spectrum of specialized middleboxes to improve their security and performance. Traditional middleboxes that are implemented by dedicated hardware are expensive and hard to manage. A promising technique of consolidated middleboxes - implementing traditional middleboxes in Virtual Machines (VMs) - offers economical yet simplified management of middleboxes in Software-Defined Networks (SDNs). However there are still challenges to realizing user routing requests with network function enforcement (a sequence of middleboxes) while maximizing the network throughput, due to various resource constraints on SDNs, such as forwarding table capacity at each switch, bandwidth resource capacity at each link, and computing resource capacity at each server (Physical Machine). In this paper, we study the problem of maximizing the network throughput of an SDN by admitting as many user requests as possible, where each user request has both bandwidth and computing resource demands to implement its network functions (consolidated middleboxes). We first formulate the problem as a novel network throughput maximization problem. We then provide an Integer Linear Program (ILP) solution for it if the problem size is small, otherwise, we devise two heuristics that strive for the fine tradeoff between the accuracy of solutions and the running times of achieving the solutions. We finally evaluate the performance of the proposed algorithms by simulations, based on real and synthetic network topologies. Experimental results demonstrate that the proposed algorithms are very promising.
Description: 41st IEEE Conference on Local Computer Networks, LCN 2016, Dubai, 7-10 November 2016
ISBN: 9781509020546
DOI: 10.1109/LCN.2016.58
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 8, 2018


Last Week
Last month
Citations as of Sep 17, 2018

Page view(s)

Last Week
Last month
Citations as of Sep 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.