Multi-Tenant Cross-Slice Resource Orchestration: A Deep Reinforcement Learning Approach
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
With the cellular networks becoming increasingly agile, a major challenge lies in how to support diverse services for mobile users (MUs) over a common physical network infrastructure. Network slicing is a promising solution to tailor the network to match such service requests. This paper considers a system with radio access network (RAN)-only slicing, where the physical infrastructure is split into slices providing computation and communication functionalities. A limited number of channels are auctioned across scheduling slots to MUs of multiple service providers (SPs) (i.e., the tenants). Each SP behaves selfishly to maximize the expected long-term payoff from the competition with other SPs for the orchestration of channels, which provides its MUs with the opportunities to access the computation and communication slices. This problem is modelled as a stochastic game, in which the decision makings of a SP depend on the global network dynamics as well as the joint control policy of all SPs. To approximate the Nash equilibrium solutions, we first construct an abstract stochastic game with the local conjectures of channel auction among the SPs. We then linearly decompose the per-SP Markov decision process to simplify the decision makings at a SP and derive an online scheme based on deep reinforcement learning to approach the optimal abstract control policies. Numerical experiments show significant performance gains from our scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607
Deep Reinforcement Learning with Double Q-Learning
Van Hasselt, H., Guez, A., & Silver, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10295 · Cited by 3,318
The emergence of edge computing
Satyanarayanan, M. (2017) · Computer · doi:10.1109/mc.2017.9 · Cited by 2,832 · cited 1×
“The tension between computation-intensive applications and resource-constrained terminal devices calls for a revolution in computing infrastructure [5].”
BackgroundMobile Edge Computing: A Survey
Abbas, N., Zhang, Y., Taherkordi, A., & Skeie, T. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2750180 · Cited by 2,474
What is the best multi-stage architecture for object recognition?
Jarrett, K., Kavukcuoglu, K., Ranzato, M. A., & LeCun, Y. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459469 · Cited by 2,153 · cited 1×
“Tanh is selected as the activation function [67] and Adam as the optimizer [68].”
MethodChen, C. L. P., & Liu, Z. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2716952 · Cited by 1,957 · cited 1×
“With the consideration 11 The tradeoff between the time spent during the training process and a performance improvement with a deeper and/or wider neural network is still an open problem [38].”
BackgroundDynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705 · cited 1×
“The average channel gain experienced by a MU n ∈ N in the coverage of a BS b ∈ B at location Ln ∈ Lb during a scheduling slot k is given as [64]”
BackgroundNetwork Slicing and Softwarization: A Survey on Principles, Enabling Technologies, and Solutions
Afolabi, I., Taleb, T., Samdanis, K., Ksentini, A., & Flinck, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2815638 · Cited by 1,078 · cited 1×
“By abstracting all physical base stations (BSs) in a geographical area as a logical big BS, the software-defined networking (SDN) concept provides infrastructure flexibility as well as service-oriented customization [10], [11], and hence simplifies the management of a dense RAN [12]–[14].”
BackgroundNetwork Slicing for 5G with SDN/NFV: Concepts, Architectures, and Challenges
Ordonez-Lucena, J., Ameigeiras, P., Lopez, D., Ramos-Munoz, J. J., Lorca, J., & Folgueira, J. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1600935 · Cited by 836 · cited 1×
“Building upon the 3GPP TSG SA 5 network sharing paradigm [17], a software-defined RAN architecture and its integration with network function virtualization enable RAN-only slicing that splits the physical RAN infrastructure into multiple virtual slices [21], [22].”
Method
Cited by
Application of Machine Learning in Wireless Networks: Key Techniques and Open Issues
Sun, Y., Peng, M., Zhou, Y., Huang, Y., & Mao, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924243 · Cited by 678
“Recently, the authors in [133] and [134] have applied DRL to network slicing, and the advantages of DRL are demonstrated via simulations.”
MethodHolistic Network Virtualization and Pervasive Network Intelligence for 6G
Shen, X., Gao, J., Wu, W., Li, M., Zhou, C., & Zhuang, W. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3135829 · Cited by 392
AI-Assisted Network-Slicing Based Next-Generation Wireless Networks
Shen, X., Gao, J., Wu, W., Lyu, K., Li, M., Zhuang, W., Li, X., & Rao, J. (2020) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2020.2965100 · Cited by 342
Communication-Efficient Federated Learning for Digital Twin Edge Networks in Industrial IoT
Lu, Y., Huang, X., Zhang, K., Maharjan, S., & Zhang, Y. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2020.3010798 · Cited by 316
“In [13], the authors formulated the multitenant cross-slice radio resource orchestration problem as a multiagent Markov decision process and leveraged DRL to learn the optimal policies.”
BackgroundSecure and Efficient Federated Learning for Smart Grid With Edge-Cloud Collaboration
Su, Z., Wang, Y., Luan, T. H., Zhang, N., Li, F., Chen, T., & Cao, H. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3095506 · Cited by 301
Metadata
- Authors
- Chen, X., Zhao, Z., Wu, C., Bennis, M., Liu, H., Ji, Y., & Zhang, H.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2019-10
- Volume
- 37
- Issue
- 10
- Pages
- 2377-2392
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W2970759804
- Cited by
- 134
- References
- 11
- FWCI
- 11.84
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.