|
Title
|
|
|
|
Airtime-based resource allocation modeling for network slicing in IEEE 802.11 RANs
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In this letter, we propose an airtime-based RA model for network slicing in IEEE 802.11 RAN. We formulate this problem as a QCQP, where the overall queueing delay of the system is minimized while strict URLLC constraints are respected. We evaluated our model using three different solvers where the optimal and feasible sets of airtime configurations were computed. We also validated our model with experimentation in real hardware. Our results show that the solution time for computing optimal and feasible configurations vary according to the slice’s demand distribution and the number of slices to be allocated. Our findings support the need for precise RA over IEEE 802.11 RAN and present the limitations of performing such optimizations at runtime. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
IEEE communications letters / Institute of Electrical and Electronics Engineers, Communications Society. - New York, N.Y.
|
|
|
Publication
|
|
|
|
New York, N.Y.
:
2020
|
|
|
ISSN
|
|
|
|
1089-7798
|
|
|
DOI
|
|
|
|
10.1109/LCOMM.2020.2977906
|
|
|
Volume/pages
|
|
|
|
24
:5
(2020)
, p. 1077-1080
|
|
|
ISI
|
|
|
|
000536637200030
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|