Inter-slice B5G Bandwidth Resource Allocation

Fadoua Debbabi, Raouia Taktak, Rihab Jmal, L. Chaari, R. Aguiar
{"title":"Inter-slice B5G Bandwidth Resource Allocation","authors":"Fadoua Debbabi, Raouia Taktak, Rihab Jmal, L. Chaari, R. Aguiar","doi":"10.1109/NCA57778.2022.10013545","DOIUrl":null,"url":null,"abstract":"The Beyond 5G (B5G) networks vision afford wireless access to a vertical market with varying Quality of Service (QoS) requirements. Network Slicing (NS) is one of the key features that offers the opportunity to have a logical network that affects the market model of these verticals. Accordingly, Network Slicing opens the door to new market players including the Infrastructure Provider (InP) and the Virtual Network Operator (VNO). The InP is the owner of the infrastructure that supports several types of slices. The VNO will buy network resources (i.e., bandwidth) from the InP in order to provide a particular service to its users. Consequently, deciding on the optimal resources allocation among VNO users while maximizing the revenue of the InP has become a fundamental issue that needs to be solved. Previous works have presented optimal solutions for resources allocation and focused mainly on a single scenario based on pricing mechanisms. In this paper, we propose an inter-slice resources allocation based on multiple sets, namely customer residential profile, industry coverage, and business area. We propose an Integer Linear Programming (ILP) formulation to the problem, describe an admission control scheme and devise a greedy-based heuristic to solve the problem.","PeriodicalId":251728,"journal":{"name":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 21st International Symposium on Network Computing and Applications (NCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA57778.2022.10013545","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Beyond 5G (B5G) networks vision afford wireless access to a vertical market with varying Quality of Service (QoS) requirements. Network Slicing (NS) is one of the key features that offers the opportunity to have a logical network that affects the market model of these verticals. Accordingly, Network Slicing opens the door to new market players including the Infrastructure Provider (InP) and the Virtual Network Operator (VNO). The InP is the owner of the infrastructure that supports several types of slices. The VNO will buy network resources (i.e., bandwidth) from the InP in order to provide a particular service to its users. Consequently, deciding on the optimal resources allocation among VNO users while maximizing the revenue of the InP has become a fundamental issue that needs to be solved. Previous works have presented optimal solutions for resources allocation and focused mainly on a single scenario based on pricing mechanisms. In this paper, we propose an inter-slice resources allocation based on multiple sets, namely customer residential profile, industry coverage, and business area. We propose an Integer Linear Programming (ILP) formulation to the problem, describe an admission control scheme and devise a greedy-based heuristic to solve the problem.
B5G片间带宽资源分配
超5G (B5G)网络愿景为具有不同服务质量(QoS)要求的垂直市场提供无线接入。网络切片(NS)是一个关键特性,它提供了一个影响这些垂直市场模型的逻辑网络的机会。因此,网络切片为新的市场参与者打开了大门,包括基础设施提供商(InP)和虚拟网络运营商(VNO)。InP是支持多种类型片的基础设施的所有者。VNO将从InP购买网络资源(即带宽),以便向其用户提供特定的服务。因此,如何在实现InP收益最大化的同时,在VNO用户之间进行最优的资源分配,已经成为一个需要解决的根本性问题。以前的工作提出了资源配置的最优解决方案,主要集中在基于定价机制的单一场景。在本文中,我们提出了一种基于多集(即客户居住概况、行业覆盖范围和业务区域)的片间资源配置方法。我们提出了一个整数线性规划(ILP)公式,描述了一个准入控制方案,并设计了一个基于贪婪的启发式算法来解决这个问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信