Distance Based Server Selection in 5G Networks

Å. Arvidsson
{"title":"Distance Based Server Selection in 5G Networks","authors":"Å. Arvidsson","doi":"10.23919/softcom55329.2022.9911423","DOIUrl":null,"url":null,"abstract":"Distance aware selection of servers and other net-worked resources is necessary to take full advantage of the 5G ecosystem, where the new radio and edge computing both contribute to significantly reduced latencies, but where propagation times to distant servers may add noticeable delays. The literature on server selection, and in particular on distance aware server selection, is, however, surprisingly thin. The few approaches we have come across are either relatively complex, based on continuous measurements, or both and not reflected in current standards. The present work therefore aims at simple but accurate mechanisms which build on and are backward compatible with present standards. We briefly describe the existing alternatives for distance aware selection as reflected in the standards, and propose include location information in server URLs such that distances can be explicitly calculated and evaluated by selecting entities. Moreover, we present three distinct and simple approaches to encode locations, two of which advantageously can be combined. The performance of the methods are then subject to a comprehensive performance evaluation where a large number of varied scenarios are considered. The results reveal that simple geographical coordinates should be restricted to very dense networks (typically networks which form full meshes) whereas a combination of the other approaches work well in other networks (in our case networks based on trees, stars or loops). Contrary to earlier proposals, our proposals consistently provide upper bounds on distances which eliminates the uncertainties that surrounds approximate solutions.","PeriodicalId":261625,"journal":{"name":"2022 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/softcom55329.2022.9911423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Distance aware selection of servers and other net-worked resources is necessary to take full advantage of the 5G ecosystem, where the new radio and edge computing both contribute to significantly reduced latencies, but where propagation times to distant servers may add noticeable delays. The literature on server selection, and in particular on distance aware server selection, is, however, surprisingly thin. The few approaches we have come across are either relatively complex, based on continuous measurements, or both and not reflected in current standards. The present work therefore aims at simple but accurate mechanisms which build on and are backward compatible with present standards. We briefly describe the existing alternatives for distance aware selection as reflected in the standards, and propose include location information in server URLs such that distances can be explicitly calculated and evaluated by selecting entities. Moreover, we present three distinct and simple approaches to encode locations, two of which advantageously can be combined. The performance of the methods are then subject to a comprehensive performance evaluation where a large number of varied scenarios are considered. The results reveal that simple geographical coordinates should be restricted to very dense networks (typically networks which form full meshes) whereas a combination of the other approaches work well in other networks (in our case networks based on trees, stars or loops). Contrary to earlier proposals, our proposals consistently provide upper bounds on distances which eliminates the uncertainties that surrounds approximate solutions.
5G网络中基于距离的服务器选择
服务器和其他网络资源的距离感知选择对于充分利用5G生态系统是必要的,在5G生态系统中,新的无线电和边缘计算都有助于显着降低延迟,但到远程服务器的传播时间可能会增加明显的延迟。然而,关于服务器选择的文献,特别是关于距离感知服务器选择的文献,却出奇的少。我们遇到的少数方法要么相对复杂,要么基于连续测量,要么两者兼而有之,而且没有反映在当前的标准中。因此,目前的工作旨在建立在现有标准之上并向后兼容的简单而准确的机制。我们简要描述了标准中反映的距离感知选择的现有替代方案,并建议在服务器url中包含位置信息,以便通过选择实体来明确计算和评估距离。此外,我们提出了三种不同而简单的方法来编码位置,其中两种可以很好地组合在一起。然后对方法的性能进行综合性能评估,其中考虑了大量不同的场景。结果表明,简单的地理坐标应该限制在非常密集的网络中(通常是形成完整网格的网络),而其他方法的组合在其他网络中(在我们的情况下,基于树、星或环的网络)也能很好地工作。与以前的建议相反,我们的建议始终提供距离的上界,从而消除了围绕近似解的不确定性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信