Title: Research on the on-demand scheduling algorithm of intelligent routing load based on SDN

Authors: Zheng Ma; Yan Ma; Xiaohong Huang; Manjun Zhang; Bo Su; Liang Zhao

Addresses: Beijing University of Posts and Telecommunications, Beijing 100876, China; Network Technology Research Institute, China United Network Communications Co., Ltd., Beijing 100048, China ' Beijing University of Posts and Telecommunications, Beijing 100876, China ' Beijing University of Posts and Telecommunications, Beijing 100876, China ' Network Technology Research Institute, China United Network Communications Co., Ltd., Beijing 100048, China ' College of Aerospace Science and Technology, Xidian University, Xi'an 710000, China ' Science and Technology on Space Physics Laboratory, Beijing, China

Abstract: Aiming at the traditional on-demand scheduling method of routing load, there are many problems, such as long time to complete the total task and high energy consumption. An on-demand scheduling method of routing load based on multiple SINKs is proposed. The total routing load task is sent from multiple SINK nodes to SDN network. After receiving the sub-tasks sent by SINK, the intra-cluster nodes begin to collect network data together. After the cluster heads fuse the network data transmitted by the nodes, the results are sent to SINK nodes. As a result, the shortest total task completion time is obtained, and the shortest total task completion time is used as the objective function of routing load scheduling on demand. Ant colony algorithm is used to solve the problem and complete the scheduling. Experimental results show that the proposed method has shorter completion time and lower energy consumption of total task.

Keywords: SDN; routing load; on-demand scheduling; intelligence.

DOI: 10.1504/IJIPT.2021.113902

International Journal of Internet Protocol Technology, 2021 Vol.14 No.1, pp.23 - 32

Received: 06 Feb 2019
Accepted: 08 May 2019
Published online: 01 Apr 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article