期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Dynamic Routing Optimization Algorithm for Software Defined Networking
1
作者 Nancy Abbas El-Hefnawy Osama Abdel Raouf Heba Askr 《Computers, Materials & Continua》 SCIE EI 2022年第1期1349-1362,共14页
Time and space complexity is themost critical problemof the current routing optimization algorithms for Software Defined Networking(SDN).To overcome this complexity,researchers use meta-heuristic techniques inside the... Time and space complexity is themost critical problemof 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 amutation 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 divide the SDN network to overcome the problemof time and space complexity.The results of the proposed algorithm compared with the results of other similar algorithms and it shows that the proposed algorithm can handle the dynamic network changing,reduce the network congestion,the delay and running times and the packet loss rates. 展开更多
关键词 dynamic routing optimization Openflow software defined networking
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部