基于历史数据的负载均衡与用户关联

Yuejie Zhang, Kai Sun, Xuelian Gao, W. Huang, Haijun Zhang
{"title":"基于历史数据的负载均衡与用户关联","authors":"Yuejie Zhang, Kai Sun, Xuelian Gao, W. Huang, Haijun Zhang","doi":"10.1109/GLOBECOM46510.2021.9685782","DOIUrl":null,"url":null,"abstract":"With the rapid increase of demand on mobile data traffic of user equipment (UE), network operators have begun to deploy abundant heterogeneous base stations (BSs) to ensure the quality of service (QoS) of UEs, which will cause new problems such as network congestion and load imbalance. If the pattern of user association (UA) can be adjusted in accordance with the results of traffic prediction, the performance of system will be greatly improved. Therefore, a new neural network approach based on spatial and temporal characteristics of traffic data is proposed for traffic prediction. The fluctuations of traffic in the future week are predicted by the proposed method. Then, UA is represented as a problem of maximizing the utility function of load balancing index, and a dynamic user association based on load prediction algorithm (DUALP) which aims to achieve a proactive load balancing is proposed. The QoS of UEs is ensured and the long-term stability of the system is achieved by DUALP. Experimental results show that compared to the classic UA strategies, the most optimal load distribution is realized by DUALP.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Load Balancing and User Association Based on Historical Data\",\"authors\":\"Yuejie Zhang, Kai Sun, Xuelian Gao, W. Huang, Haijun Zhang\",\"doi\":\"10.1109/GLOBECOM46510.2021.9685782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid increase of demand on mobile data traffic of user equipment (UE), network operators have begun to deploy abundant heterogeneous base stations (BSs) to ensure the quality of service (QoS) of UEs, which will cause new problems such as network congestion and load imbalance. If the pattern of user association (UA) can be adjusted in accordance with the results of traffic prediction, the performance of system will be greatly improved. Therefore, a new neural network approach based on spatial and temporal characteristics of traffic data is proposed for traffic prediction. The fluctuations of traffic in the future week are predicted by the proposed method. Then, UA is represented as a problem of maximizing the utility function of load balancing index, and a dynamic user association based on load prediction algorithm (DUALP) which aims to achieve a proactive load balancing is proposed. The QoS of UEs is ensured and the long-term stability of the system is achieved by DUALP. Experimental results show that compared to the classic UA strategies, the most optimal load distribution is realized by DUALP.\",\"PeriodicalId\":200641,\"journal\":{\"name\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOBECOM46510.2021.9685782\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOBECOM46510.2021.9685782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

随着用户设备移动数据流量需求的快速增长,网络运营商为保证用户设备的服务质量,开始大量部署异构基站,这将带来网络拥塞、负载不均衡等新问题。如果可以根据流量预测结果调整用户关联模式,将大大提高系统的性能。为此,提出了一种基于交通数据时空特征的神经网络预测方法。利用该方法对未来一周的流量波动进行了预测。然后,将用户交互表示为负载均衡指标效用函数最大化问题,提出了一种基于负载预测的动态用户关联算法(DUALP),以实现主动负载均衡。通过DUALP保证了ue的QoS,实现了系统的长期稳定。实验结果表明,与传统的UA策略相比,DUALP实现了最优的负载分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Load Balancing and User Association Based on Historical Data
With the rapid increase of demand on mobile data traffic of user equipment (UE), network operators have begun to deploy abundant heterogeneous base stations (BSs) to ensure the quality of service (QoS) of UEs, which will cause new problems such as network congestion and load imbalance. If the pattern of user association (UA) can be adjusted in accordance with the results of traffic prediction, the performance of system will be greatly improved. Therefore, a new neural network approach based on spatial and temporal characteristics of traffic data is proposed for traffic prediction. The fluctuations of traffic in the future week are predicted by the proposed method. Then, UA is represented as a problem of maximizing the utility function of load balancing index, and a dynamic user association based on load prediction algorithm (DUALP) which aims to achieve a proactive load balancing is proposed. The QoS of UEs is ensured and the long-term stability of the system is achieved by DUALP. Experimental results show that compared to the classic UA strategies, the most optimal load distribution is realized by DUALP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信