Joint Base Station Selection and Adaptive Slicing in Virtualized Wireless Networks: A Stochastic Optimization Framework

Kory Teague, Mohammad J. Abdel-Rahman, A. B. Mackenzie
{"title":"Joint Base Station Selection and Adaptive Slicing in Virtualized Wireless Networks: A Stochastic Optimization Framework","authors":"Kory Teague, Mohammad J. Abdel-Rahman, A. B. Mackenzie","doi":"10.1109/ICCNC.2019.8685518","DOIUrl":null,"url":null,"abstract":"Wireless network virtualization is a promising avenue of research for next-generation 5G cellular networks. Virtualization focuses on the concept of active resource sharing and the building of a network designed for specific demands, decreasing operational expenditures, and improving demand satisfaction of cellular networks. This work investigates the problem of selecting base stations (BSs) to construct a virtual network that meets the the specific demands of a service provider, and adaptive slicing of the resources between the service provider’s demand points. A two-stage stochastic optimization framework is introduced to model the problem of joint BS selection and adaptive slicing. Two methods are presented for determining an approximation for the two-stage stochastic optimization model. The first method uses a sampling approach applied to the deterministic equivalent program of the stochastic model. The second method uses a genetic algorithm for BS selection and adaptive slicing via a single-stage linear optimization problem. For testing, a number of scenarios were generated using a log-normal model designed to emulate demand from real world cellular networks. Simulations indicate that the first approach can provide a reasonably good solution, but is constrained as the time expense grows exponentially with the number of parameters. The second approach provides a vast improvement in run time with the introduction of some error.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2019.8685518","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Wireless network virtualization is a promising avenue of research for next-generation 5G cellular networks. Virtualization focuses on the concept of active resource sharing and the building of a network designed for specific demands, decreasing operational expenditures, and improving demand satisfaction of cellular networks. This work investigates the problem of selecting base stations (BSs) to construct a virtual network that meets the the specific demands of a service provider, and adaptive slicing of the resources between the service provider’s demand points. A two-stage stochastic optimization framework is introduced to model the problem of joint BS selection and adaptive slicing. Two methods are presented for determining an approximation for the two-stage stochastic optimization model. The first method uses a sampling approach applied to the deterministic equivalent program of the stochastic model. The second method uses a genetic algorithm for BS selection and adaptive slicing via a single-stage linear optimization problem. For testing, a number of scenarios were generated using a log-normal model designed to emulate demand from real world cellular networks. Simulations indicate that the first approach can provide a reasonably good solution, but is constrained as the time expense grows exponentially with the number of parameters. The second approach provides a vast improvement in run time with the introduction of some error.
虚拟无线网络中的联合基站选择与自适应切片:一个随机优化框架
无线网络虚拟化是下一代5G蜂窝网络研究的一个有前途的途径。虚拟化关注的是主动资源共享的概念和为特定需求设计的网络的构建,减少运营支出,提高蜂窝网络的需求满意度。本文研究了选择基站(BSs)来构建满足服务提供商特定需求的虚拟网络的问题,以及服务提供商需求点之间的资源自适应切片。引入一种两阶段随机优化框架,对联合BS选择和自适应切片问题进行建模。给出了确定两阶段随机优化模型近似值的两种方法。第一种方法是将抽样方法应用于随机模型的确定性等效程序。第二种方法通过单阶段线性优化问题,采用遗传算法进行BS选择和自适应切片。为了进行测试,使用对数正态模型生成了许多场景,该模型旨在模拟现实世界蜂窝网络的需求。仿真表明,第一种方法可以提供相当好的解决方案,但由于时间开销随参数数量呈指数增长而受到限制。第二种方法通过引入一些错误,在运行时方面提供了巨大的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信