Premium
Middlebox selection optimization via an intelligent framework in software‐defined networking
Author(s) -
Zadkhosh Ehsan,
Bahramgiri Hossein,
Sabaei Masoud
Publication year - 2021
Publication title -
transactions on emerging telecommunications technologies
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.366
H-Index - 47
ISSN - 2161-3915
DOI - 10.1002/ett.4236
Subject(s) - computer science , software defined networking , equal cost multi path routing , routing (electronic design automation) , load balancing (electrical power) , computer network , network performance , shortest path problem , path (computing) , distributed computing , software , static routing , routing protocol , operating system , mathematics , graph , geometry , theoretical computer science , grid
Software‐defined networking (SDN) has a vital role in network resource utilization. However, it does not provide a comprehensive view of middleboxes (MBs). In this article, we proposed an intelligent dynamic routing framework for performance optimization based on a SDN architecture with a comprehensive view of all network properties. This routing framework also uses the genetic algorithm (GA) for performance improvement. It extracts the CPU, memory, and bandwidth utilization of MBs as dynamic routing parameters. The implemented GA calculates the impact factor (IF) of these parameters to declare the impact of each parameter in network performance. The obtained results show that considering MBs status in flow forwarding improves the tested network's resource utilization by 13, 10, and 7 times compared with hop‐based shortest path first, random path selection, and Round Robin methods, respectively. The results also showed that considering IFs (IF CPU , IF RAM , and IF BW ) in routing procedure would improve the network's performance. Therefore, we used the GA to calculate optimal IFs for fairness load balancing and performance optimization. The GA calculates 0.4 and 0.6, for IF CPU and IF BW , respectively. It calculates these IFs only after five iterations. It also showed that we could ignore the RAM utilization parameter in our dynamic routing as our MBs are not memory‐bounded. The simulation results declared that routing with optimal IFs not only improves the network' throughput but also improves load distribution fairness by about 25% compared with routing without the IFs.