Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2017, Vol. 40 ›› Issue (s1): 93-97.doi: 10.13190/j.jbupt.2017.s.021

• Papers • Previous Articles     Next Articles

A Load Balancing Predication Algorithm of CART and KNN

ZHU Bin, SUN Bin   

  1. Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2016-05-29 Online:2017-09-28 Published:2017-09-28

Abstract: To address the problems in the mobile platform based on XMPP protocol, a prediction method of the server load based on classification and regression tree and K-nearest neighbor machine learning algorithm was presented. The algorithm made up time series of load by gathering every node's load information comprehensively and analyzed the time series, to carry out prediction. And then, the server nodes were divided into three regions, different scheduling strategies were used in different regions. Simulation experiments and tests showed that compared with the weight round robin and least connection algorithm, this proposed prediction algorithm decreased connection response time by 25%, and increased the connection establishment by 1.3 times. Dynamic scheduling strategy made the communication server cluster has a greater network throughput, which has more robust adaptability for mobile platform.

Key words: load balancing, forecast of time series, classification and regression tree, K-nearest neighbor, dynamic scheduling strategy

CLC Number: