Nancy Abbas El-Hefnawy1,*, Osama Abdel Raouf2, Heba Askr3
CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1349-1362, 2022, DOI:10.32604/cmc.2022.017787
- 07 September 2021
Abstract Time and space complexity is the most critical problem of the current routing optimization algorithms for Software Defined Networking (SDN). To overcome this complexity, researchers use meta-heuristic techniques inside the routing optimization algorithms in the OpenFlow (OF) based large scale SDNs. This paper proposes a hybrid meta-heuristic algorithm to optimize the dynamic routing problem for the large scale SDNs. Due to the dynamic nature of SDNs, the proposed algorithm uses a mutation operator to overcome the memory-based problem of the ant colony algorithm. Besides, it uses the box-covering method and the k-means clustering method to More >
Login
Register
