Loading…
Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties
Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resou...
Saved in:
Published in: | arXiv.org 2022-03 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Quang-Trung Luu Kerboeuf, Sylvaine Kieffer, Michel |
description | Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a best-effort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements. This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a non-linear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2640462369</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2640462369</sourcerecordid><originalsourceid>FETCH-proquest_journals_26404623693</originalsourceid><addsrcrecordid>eNqNjUsKwkAQRAdBUDR3aHAtxJkYdSniZ-FC_KzDYFpsiTOme6Lg6U3EA7iqgveoaqmuNmY0nCZad1QkcovjWKcTPR6brirn-Z1EyDtYeBfYF2BdDnsUX_EZm4L8tKERLp5hx-SZAr0xh0NBX6OsUILAi8IV1pVl6wI2eDuHyuXIcHJn5GDJBULpq_bFFoLRL3tqsFoeF5vhg_13KbvV165GmU6TOEm1SWfmP-sDgEFLvw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2640462369</pqid></control><display><type>article</type><title>Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties</title><source>Publicly Available Content Database</source><creator>Quang-Trung Luu ; Kerboeuf, Sylvaine ; Kieffer, Michel</creator><creatorcontrib>Quang-Trung Luu ; Kerboeuf, Sylvaine ; Kieffer, Michel</creatorcontrib><description>Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a best-effort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements. This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a non-linear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Admission control ; Cost function ; Infrastructure ; Network slicing ; Optimization ; Uncertainty ; Virtual networks</subject><ispartof>arXiv.org, 2022-03</ispartof><rights>2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2640462369?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25752,37011,44589</link.rule.ids></links><search><creatorcontrib>Quang-Trung Luu</creatorcontrib><creatorcontrib>Kerboeuf, Sylvaine</creatorcontrib><creatorcontrib>Kieffer, Michel</creatorcontrib><title>Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties</title><title>arXiv.org</title><description>Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a best-effort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements. This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a non-linear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request.</description><subject>Admission control</subject><subject>Cost function</subject><subject>Infrastructure</subject><subject>Network slicing</subject><subject>Optimization</subject><subject>Uncertainty</subject><subject>Virtual networks</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNjUsKwkAQRAdBUDR3aHAtxJkYdSniZ-FC_KzDYFpsiTOme6Lg6U3EA7iqgveoaqmuNmY0nCZad1QkcovjWKcTPR6brirn-Z1EyDtYeBfYF2BdDnsUX_EZm4L8tKERLp5hx-SZAr0xh0NBX6OsUILAi8IV1pVl6wI2eDuHyuXIcHJn5GDJBULpq_bFFoLRL3tqsFoeF5vhg_13KbvV165GmU6TOEm1SWfmP-sDgEFLvw</recordid><startdate>20220317</startdate><enddate>20220317</enddate><creator>Quang-Trung Luu</creator><creator>Kerboeuf, Sylvaine</creator><creator>Kieffer, Michel</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20220317</creationdate><title>Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties</title><author>Quang-Trung Luu ; Kerboeuf, Sylvaine ; Kieffer, Michel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26404623693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Admission control</topic><topic>Cost function</topic><topic>Infrastructure</topic><topic>Network slicing</topic><topic>Optimization</topic><topic>Uncertainty</topic><topic>Virtual networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Quang-Trung Luu</creatorcontrib><creatorcontrib>Kerboeuf, Sylvaine</creatorcontrib><creatorcontrib>Kieffer, Michel</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Quang-Trung Luu</au><au>Kerboeuf, Sylvaine</au><au>Kieffer, Michel</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties</atitle><jtitle>arXiv.org</jtitle><date>2022-03-17</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>Network slicing has emerged as a key concept in 5G systems, allowing Mobile Network Operators (MNOs) to build isolated logical networks (slices) on top of shared infrastructure networks managed by Infrastructure Providers (InP). Network slicing requires the assignment of infrastructure network resources to virtual network components at slice activation time and the adjustment of resources for slices under operation. Performing these operations just-in-time, on a best-effort basis, comes with no guarantee on the availability of enough infrastructure resources to meet slice requirements. This paper proposes a prioritized admission control mechanism for concurrent slices based on an infrastructure resource reservation approach. The reservation accounts for the dynamic nature of slice requests while being robust to uncertainties in slice resource demands. Adopting the perspective of an InP, reservation schemes are proposed that maximize the number of slices for which infrastructure resources can be granted while minimizing the costs charged to the MNOs. This requires the solution of a max-min optimization problem with a non-linear cost function and non-linear constraints induced by the robustness to uncertainties of demands and the limitation of the impact of reservation on background services. The cost and the constraints are linearized and several reduced-complexity strategies are proposed to solve the slice admission control and resource reservation problem. Simulations show that the proportion of admitted slices of different priority levels can be adjusted by a differentiated selection of the delay between the reception and the processing instants of a slice resource request.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2022-03 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2640462369 |
source | Publicly Available Content Database |
subjects | Admission control Cost function Infrastructure Network slicing Optimization Uncertainty Virtual networks |
title | Admission Control and Resource Reservation for Prioritized Slice Requests with Guaranteed SLA under Uncertainties |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T00%3A57%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Admission%20Control%20and%20Resource%20Reservation%20for%20Prioritized%20Slice%20Requests%20with%20Guaranteed%20SLA%20under%20Uncertainties&rft.jtitle=arXiv.org&rft.au=Quang-Trung%20Luu&rft.date=2022-03-17&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2640462369%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_26404623693%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2640462369&rft_id=info:pmid/&rfr_iscdi=true |