A Q-Learning Routing Algorithm Based on Software Defined Networking Platform

Abstract

This paper proposes a Q-learning-based routing algorithm for the routing optimization problem in wireless communication networks. The algorithm utilizes an agent to take actions in the transmission environment, change the corresponding state to obtain rewards, and update the Q-matrix. Through iterative steps, the Q-matrix eventually converges. After learning, the optimal routing strategy can be obtained relying on the Q-table. In addition, this paper solves the consensus problem and routing loop problem between nodes using the SDN network architecture. To meet different quality of service requirements, a new reward function is proposed for the Q-learning algorithm, which considers both transmission bandwidth, communication delay, packet loss rate, and transmission service type. Simulation experiments demonstrate that the proposed Q-learning-based routing optimization algorithm outperforms traditional routing algorithms in terms of communication quality.