Admission Control Algorithm for Network Slicing Management in SDN-NFV Environment

Amal Kammoun, N. Tabbane, G. Diaz, N. Achir
{"title":"Admission Control Algorithm for Network Slicing Management in SDN-NFV Environment","authors":"Amal Kammoun, N. Tabbane, G. Diaz, N. Achir","doi":"10.1109/ICMCS.2018.8525945","DOIUrl":null,"url":null,"abstract":"Future networks have to be flexible to satisfy requirements of 5G use cases. Software Defined Networking (SDN), Network Function virtualization (NFV) and Network Slicing technologies have proved to be promising paradigms for new services provisioning. In our work, we propose a new mechanism for the admission control of new users’ requests. To this aim, we propose a network orchestrator module which receives new users’ requests and then determines if their demands can be served by an existing slice on not. The major aim of our algorithm is the selection of the best target slice for the user request based on several network criteria such as the network resources latency, availability and reliability as well as their computational performances. Thus, according to the proposed algorithm, users’ requests will be mapped into the slice that corresponds perfectly to the request. A mathematical formulation of our proposed algorithm and a performance evaluation are presented. We demonstrate that by providing the ideal slice for users’ requests, the quality of service afforded to the users will be enhanced.","PeriodicalId":272255,"journal":{"name":"2018 6th International Conference on Multimedia Computing and Systems (ICMCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 6th International Conference on Multimedia Computing and Systems (ICMCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMCS.2018.8525945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Future networks have to be flexible to satisfy requirements of 5G use cases. Software Defined Networking (SDN), Network Function virtualization (NFV) and Network Slicing technologies have proved to be promising paradigms for new services provisioning. In our work, we propose a new mechanism for the admission control of new users’ requests. To this aim, we propose a network orchestrator module which receives new users’ requests and then determines if their demands can be served by an existing slice on not. The major aim of our algorithm is the selection of the best target slice for the user request based on several network criteria such as the network resources latency, availability and reliability as well as their computational performances. Thus, according to the proposed algorithm, users’ requests will be mapped into the slice that corresponds perfectly to the request. A mathematical formulation of our proposed algorithm and a performance evaluation are presented. We demonstrate that by providing the ideal slice for users’ requests, the quality of service afforded to the users will be enhanced.
SDN-NFV环境下网络切片管理的准入控制算法
未来的网络必须具有灵活性,以满足5G用例的需求。软件定义网络(SDN)、网络功能虚拟化(NFV)和网络切片技术已被证明是新业务提供的有前途的范例。在我们的工作中,我们提出了一种新的机制来控制新用户的请求。为此,我们提出了一个网络编排器模块,该模块接收新用户的请求,然后确定他们的需求是否可以由现有的片来服务。该算法的主要目的是根据网络资源的延迟、可用性、可靠性及其计算性能等多种网络标准,为用户的请求选择最佳的目标片。因此,根据所提出的算法,用户的请求将被映射到与请求完全对应的片中。给出了算法的数学公式和性能评价。我们证明,通过为用户的要求提供理想的切片,可以提高为用户提供的服务质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信