Abstract | ||
---|---|---|
By separating the control and forwarding planes, Software-Defined networking (SDN) enables the forwarding paths to be flexibly controlled by the logically centralized controllers using the global network view. To introduce SDN into existing networks, it is necessary to upgrade traditional devices to SDN-enabled ones. However, due to the business, economic and management limitations, it is difficult to realize full SDN deployment. As a result, how to migrate existing devices to SDN-compliant ones becomes the obvious dilemma for every network operator. In this paper, we address this question from the network performance perspective, and study how to leverage the capability of SDN to maximize traffic flow that can be achieved in hybrid SDNs. We formulate the maximum flow problem in networks with partial SDN deployment, and develop a fast Fully Polynomial Time Approximation Scheme (FPTAS) for solving it. Simulation results using real topologies show that hybrid SDNs outperform traditional networks, and we can obtain a near optimal network performance when 50% of SDN nodes are deployed. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1109/GLOCOM.2015.7417144 | IEEE Global Communications Conference |
Field | DocType | ISSN |
Approximation algorithm,Traffic flow,Global network,Software deployment,Computer science,Computer network,Network topology,Software-defined networking,Routing protocol,Network performance,Distributed computing | Conference | 2334-0983 |
Citations | PageRank | References |
3 | 0.42 | 14 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yannan Hu | 1 | 70 | 5.09 |
Wendong Wang | 2 | 821 | 72.69 |
Xiangyang Gong | 3 | 161 | 23.01 |
Xirong Que | 4 | 142 | 15.76 |
Yue Ma | 5 | 3 | 1.10 |
Shiduan Cheng | 6 | 817 | 87.36 |