A Dynamic Network Resource Demand Predicting Algorithm Based on Incremental Design of RBF

被引:0
|
作者
Xiao, Xiancui [1 ,2 ]
Zheng, Xiangwei [1 ,2 ]
机构
[1] Shandong Normal Univ, Sch Informat Sci & Engn, Jinan 250014, Shandong, Peoples R China
[2] Shandong Prov Key Lab Distributed Comp Software N, Jinan 250014, Shandong, Peoples R China
关键词
Static resource allocation; Dynamically; Time-varying; RBFN; GSO-INC-RBFDM;
D O I
10.1016/j.procs.2019.01.180
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Nowadays, the research on network mapping is mostly limited to static resource allocation. In fact, the user's demand of network resources changes dynamically over time. Therefore, how to predict the time-varying demand of users and allocate appropriate resources becomes an important way to improve resource utilization. As a fully connected artificial neural network (ANN), the RBFN (Radial Basis Function Network) has diagnostic, predictive and classification functions. However, due to the excessive use of hidden RBF units during training process, it suffers from expensive core inner product calculations and long training time. This paper proposes a dynamic network resource demand predicting algorithm based on RBF incremental design (GSO-INCRBFDM). In the network mapping, the group search optimizer (GSO) is used to optimize the mapping scheme, and then the radial basis function (RBF) of the incremental construction is used to predict the time-varying demand of the user. GSO-INCRBFDM based on incremental design of RBF can construct a compact neural network structure, which not only accelerates the training speed, but also improves the predictive accuracy. Simulation experiments show, compared with traditional algorithms and the original RBF, GSO-INC-RBFDM have lower cost, higher acceptance rate and network revenue. (C) 2019 The Authors. Published by Elsevier B.V.
引用
收藏
页码:29 / 35
页数:7
相关论文
共 50 条
  • [1] Q-Learning Algorithm Based on Incremental RBF Network
    Hu, Yanming
    Li, Decai
    He, Yuqing
    Han, Jianda
    [J]. Jiqiren/Robot, 2019, 41 (05): : 562 - 573
  • [2] Design of RBF neural network based on SAPSO algorithm
    Zhang, Wei
    Huang, Wei-Min
    [J]. Kongzhi yu Juece/Control and Decision, 2021, 36 (09): : 2305 - 2312
  • [3] Energy Demand Forecasting in China Based on Dynamic RBF Neural Network
    Zhang, Dongqing
    Ma, Kaiping
    Zhao, Yuexia
    [J]. ADVANCES IN COMPUTER SCIENCE AND EDUCATION APPLICATIONS, PT II, 2011, 202 : 388 - 395
  • [4] Application of RBF Network Based on Immune Algorithm to Predicting of Wastewater Treatment
    Ye, Hongtao
    Luo, Fei
    Xu, Yuge
    [J]. ADVANCES IN NEURAL NETWORKS - ISNN 2009, PT 3, PROCEEDINGS, 2009, 5553 : 1197 - 1202
  • [5] An RBF neural network-based dynamic virtual network embedding algorithm
    Zheng, Xiangwei
    Zhang, Yuang
    Zhang, Hui
    Xue, Qingshui
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2019, 31 (23):
  • [6] Firefly Algorithm for the RBF Network Design
    Czarnowski, Ireneusz
    Jedrzejowicz, Piotr
    [J]. 2018 INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (INISTA), 2018,
  • [7] Predicting the Emergency Logistics Demand for Tropical Cyclone Based on Improved RBF Neural Network
    Yang, Bin
    Zhang, Jian
    Zhao, Lei
    [J]. PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2011, 10 : 6 - 12
  • [8] A Dynamic-Resource-Allocation Based Flash Crowd Mitigation Algorithm for Video-on-Demand Network
    Zhou, Wenan
    Wang, Dao-yi
    [J]. PROCEEDINGS 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, (ICCSIT 2010), VOL 1, 2010, : 388 - 392
  • [9] A Novel RBF Neural Network Design Based On Immune Algorithm System
    Li, Fei
    Yang, Cuili
    Qiao, Junfei
    [J]. PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 4598 - 4603
  • [10] Algorithm for Structure Design of RBF Neural Network Based on Parameter Optimization
    Zhai, Ying-Ying
    Zuo, Li
    Zhang, En-De
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2020, 41 (02): : 176 - 181