Title
Maximizing Network Utilization For Sdn Based On Wiseant Colony Optimization
Abstract
Software-Defined Network (SDN) allows a centralized controller to globally plan packets forwarding according to the operator's objectives. It may require more forwarding rules, and multi-path routing which is allowed in SDN to improve network utilization and throughput means more forwarding rules. However, the forwarding table in TCAM-based SDN switch is an important but limited resource. With this limitation, to satisfy global network objective, such as maximum flow, we formulate this problem as the Bounded Forwarding-Rules Maximum Flow (BFR-MF) problem which is NP-hard. We maintain fairness among flows to guarantee the performance of individual flows and a certain level of QoS. We improve the Ant Colony Optimization algorithm, such as adding heuristic information based on forwarding table size, and propose the WiseAnt Colony Optimization (WACO) algorithm to solve the BFRMF problem. We use normalized maximum flow to evaluate the performance of WACO algorithm. Extensive simulations show that WACO algorithm performs better in network utilization on the premise of a certain level of QoS, especially for the data center network.
Year
DOI
Venue
2016
10.1109/HPCC-SmartCity-DSS.2016.129
PROCEEDINGS OF 2016 IEEE 18TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS; IEEE 14TH INTERNATIONAL CONFERENCE ON SMART CITY; IEEE 2ND INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (HPCC/SMARTCITY/DSS)
Keywords
Field
DocType
network utilization, software defined network, ant colony optimization, forwarding table, QoS
Ant colony optimization algorithms,Heuristic,Mathematical optimization,Algorithm design,Computer science,Network packet,Quality of service,Computer network,Maximum flow problem,Throughput,Routing table,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Shanwen Yi1166.34
Hua Wang27614.82
Xibo Yao312.38
Chuangen Gao432.08
Linbo Zhai5157.01