Dynamic routing optimization in software-defined networking based on a metaheuristic algorithm

被引:0
作者
Junyan Chen
Wei Xiao
Hongmei Zhang
Jiacheng Zuo
Xinmei Li
机构
[1] Guilin University of Electronic Technology,School of Computer Science and Information Security
[2] Guilin University of Electronic Technology,School of Information and Communication
[3] Soochow University,School of Computer Science and Technology
来源
Journal of Cloud Computing | / 13卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Optimizing resource allocation and routing to satisfy service needs is paramount in large-scale networks. Software-defined networking (SDN) is a new network paradigm that decouples forwarding and control, enabling dynamic management and configuration through programming, which provides the possibility for deploying intelligent control algorithms (such as deep reinforcement learning algorithms) to solve network routing optimization problems in the network. Although these intelligent-based network routing optimization schemes can capture network state characteristics, they are prone to falling into local optima, resulting in poor convergence performance. In order to address this issue, this paper proposes an African Vulture Routing Optimization (AVRO) algorithm for achieving SDN routing optimization. AVRO is based on the African Vulture Optimization Algorithm (AVOA), a population-based metaheuristic intelligent optimization algorithm with global optimization ability and fast convergence speed advantages. First, we improve the population initialization method of the AVOA algorithm according to the characteristics of the network routing problem to enhance the algorithm’s perception capability towards network topology. Subsequently, we add an optimization phase to strengthen the development of the AVOA algorithm and achieve stable convergence effects. Finally, we model the network environment, define the network optimization objective, and perform comparative experiments with the baseline algorithms. The experimental results demonstrate that the routing algorithm has better network awareness, with a performance improvement of 16.9% compared to deep reinforcement learning algorithms and 71.8% compared to traditional routing schemes.
引用
收藏
相关论文
共 122 条
  • [1] Ali J(2023)ESCALB: An effective slave controller allocation-based load balancing scheme for multi-domain SDN-enabled-IoT networks Journal of King Saud University-Computer and Information Sciences 35 101566-786
  • [2] Rutvij H(2023)A research review of OpenFlow for datacenter networking IEEE Access 11 770-2027
  • [3] Mohannad A(2022)Requirements of API documentation: a case study into computer vision services IEEE Trans Software Eng 48 2010-881
  • [4] Byeong-hee R(2021)Intelligent routing based on reinforcement learning for software-defined networking IEEE Trans Netw Serv Manage 18 870-8819
  • [5] Miguel-Alonso J(2021)Deep reinforcement learning-based network routing technology for data recovery in exa-scale cloud distributed clustering systems Appl Sci 11 8727-24
  • [6] Cummaudo A(2021)A comprehensive survey on graph neural networks IEEE Transactions on Neural Networks and Learning Systems 32 4-1270
  • [7] Vasa R(2019)A review of recurrent neural networks: LSTM cells and network architectures Neural Computer 31 1235-2100
  • [8] Grundy J(2022)Comparative analysis of routing schemes based on machine learning Mob Inf Syst 2022 4560072-174791
  • [9] Abdelrazek M(2016)Deep reinforcement learning with double Q-learning AAAI Conference on Artificial Intelligence 2016 2094-3174
  • [10] Casas-Velasco D(2020)QR-SDN: Towards reinforcement learning states, actions, and rewards for direct flow routing in software-defined networks IEEE Access 8 174773-1541