Paper Info
Title
Maximizing Network Utilization For Sdn Based On Particle Swarm Optimization
Abstract
Software Defined Networks (SDNs) allow a centralized controller to globally plan packets forwarding according to the operator's objectives. The realization of global objectives requires more local forwarding rules. However, the forwarding tables in TCAM-based SDN switches are limited resources. In this paper, we concentrate on satisfying global network objectives, such as maximum flow, with the limitation of forwarding table size. We formulate the problem as the Bounded Forwarding-Rules Maximum Flow (BFR-MF) problem. And then, we improve the updating of particles in Particle Swarm Optimization (PSO) by merging particles and propose the PSO-based Maximum Flow (PSO-MF) algorithm to maximize the overall feasible traffic. We maintain fairness among flows to guarantee a certain level of Quality-of-Service (QoS). Extensive simulations show that PSO-MF algorithm performs well in network utilization both for backbone and data center networks.
Year
DOI
Venue
2016
10.1109/ICTAI.2016.139
2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016)
Keywords
Field
DocType
network utilization, software defined network, particle swarm optimization, forwarding table, maximum flow
Particle swarm optimization,Approximation algorithm,Mathematical optimization,Algorithm design,Computer science,Network packet,Multi-swarm optimization,Maximum flow problem,Routing table,Software-defined networking,Distributed computing
Conference
ISSN
Citations 
PageRank 
1082-3409
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Xibo Yao112.38
Hua Wang27614.82
Chuangen Gao332.08
Shanwen Yi4166.34