Optimal-Capacity, Shortest Path Routing in Self-Organizing 5G Networks using Machine Learning

Chetana V. Murudkar, R. Gitlin
{"title":"Optimal-Capacity, Shortest Path Routing in Self-Organizing 5G Networks using Machine Learning","authors":"Chetana V. Murudkar, R. Gitlin","doi":"10.1109/WAMICON.2019.8765434","DOIUrl":null,"url":null,"abstract":"Machine learning is expected to be a key enabler in 5G wireless self-organizing networks (SONs) that will be significantly more autonomous, smarter, adaptable and user-centric than current networks. This paper proposes a methodology, User Specific-Optimal Capacity Shortest Path (US-OCSP) routing, that uses machine learning to determine the resource-based optimum-capacity shortest path for a user between source and destination. The methodology takes into account two primary metrics, available capacity at network nodes (eNodeBs/gNodeBs) and distance, that are critical in determining the optimal path for an end-user. An ns-3 simulation determines the capacity, which is measured by the availability of resources [i.e., Physical Resource Blocks (PRBs)] at all possible serving network nodes between the source and destination, that is followed by implementation of Q-learning, a reinforcement type of machine learning algorithm that determines the shortest path avoiding congested network nodes so as to achieve the required throughput and/or bit rate. The ability to determine the optimal-capacity shortest path route will facilitate effective resource allocation that will optimize end-user satisfaction in a 5G SON network.","PeriodicalId":328717,"journal":{"name":"2019 IEEE 20th Wireless and Microwave Technology Conference (WAMICON)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 20th Wireless and Microwave Technology Conference (WAMICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAMICON.2019.8765434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Machine learning is expected to be a key enabler in 5G wireless self-organizing networks (SONs) that will be significantly more autonomous, smarter, adaptable and user-centric than current networks. This paper proposes a methodology, User Specific-Optimal Capacity Shortest Path (US-OCSP) routing, that uses machine learning to determine the resource-based optimum-capacity shortest path for a user between source and destination. The methodology takes into account two primary metrics, available capacity at network nodes (eNodeBs/gNodeBs) and distance, that are critical in determining the optimal path for an end-user. An ns-3 simulation determines the capacity, which is measured by the availability of resources [i.e., Physical Resource Blocks (PRBs)] at all possible serving network nodes between the source and destination, that is followed by implementation of Q-learning, a reinforcement type of machine learning algorithm that determines the shortest path avoiding congested network nodes so as to achieve the required throughput and/or bit rate. The ability to determine the optimal-capacity shortest path route will facilitate effective resource allocation that will optimize end-user satisfaction in a 5G SON network.
基于机器学习的自组织5G网络的最优容量最短路径路由
机器学习有望成为5G无线自组织网络(SONs)的关键推动因素,该网络将比目前的网络更加自主、智能、适应性和以用户为中心。本文提出了一种方法,即用户特定最优容量最短路径(US-OCSP)路由,该方法使用机器学习来确定用户在源和目标之间基于资源的最优容量最短路径。该方法考虑了两个主要指标,即网络节点(enodeb / gnodeb)的可用容量和距离,这对于确定最终用户的最佳路径至关重要。ns-3模拟确定了容量,容量由源和目的地之间所有可能的服务网络节点上的资源可用性[即物理资源块(PRBs)]来衡量,随后实现q -学习,这是一种强化型机器学习算法,确定避免拥塞网络节点的最短路径,从而实现所需的吞吐量和/或比特率。确定最佳容量最短路径路由的能力将促进有效的资源分配,从而优化5G SON网络中的最终用户满意度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信